/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/seq-pthread/cs_stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:36:05,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:36:05,676 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-25 11:36:05,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:36:05,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:36:05,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:36:05,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:36:05,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:36:05,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:36:05,697 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:36:05,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:36:05,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:36:05,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:36:05,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:36:05,699 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:36:05,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:36:05,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:36:05,699 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:36:05,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:36:05,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:36:05,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:36:05,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:36:05,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:36:05,701 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:36:05,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:36:05,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:36:05,701 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:36:05,702 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:36:05,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:36:05,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:36:05,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:36:05,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:36:05,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:36:05,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:36:05,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:36:05,704 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:36:05,704 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-25 11:36:05,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:36:05,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:36:05,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:36:05,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:36:05,896 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:36:05,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stack-1.i [2023-12-25 11:36:06,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:36:07,204 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:36:07,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stack-1.i [2023-12-25 11:36:07,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e4c5ed6/aaa195e3e6bf4eafb637ba67b05ab80c/FLAGed9ddd13e [2023-12-25 11:36:07,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e4c5ed6/aaa195e3e6bf4eafb637ba67b05ab80c [2023-12-25 11:36:07,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:36:07,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:36:07,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:36:07,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:36:07,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:36:07,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:36:07" (1/1) ... [2023-12-25 11:36:07,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7feed799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:07, skipping insertion in model container [2023-12-25 11:36:07,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:36:07" (1/1) ... [2023-12-25 11:36:07,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:36:07,854 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stack-1.i[34744,34757] [2023-12-25 11:36:07,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:36:08,004 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:36:08,027 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stack-1.i[34744,34757] [2023-12-25 11:36:08,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:36:08,099 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:36:08,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08 WrapperNode [2023-12-25 11:36:08,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:36:08,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:36:08,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:36:08,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:36:08,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,157 INFO L138 Inliner]: procedures = 258, calls = 274, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 635 [2023-12-25 11:36:08,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:36:08,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:36:08,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:36:08,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:36:08,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,212 INFO L175 MemorySlicer]: Split 130 memory accesses to 17 slices as follows [13, 2, 8, 3, 8, 20, 12, 12, 7, 0, 4, 5, 12, 6, 3, 7, 8]. 15 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [0, 2, 3, 0, 3, 6, 6, 2, 0, 0, 2, 2, 0, 2, 0, 0, 2]. The 38 writes are split as follows [7, 0, 2, 1, 2, 8, 3, 3, 1, 0, 1, 1, 2, 2, 1, 1, 3]. [2023-12-25 11:36:08,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:36:08,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:36:08,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:36:08,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:36:08,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (1/1) ... [2023-12-25 11:36:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:36:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:36:08,296 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-25 11:36:08,318 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-25 11:36:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-25 11:36:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-25 11:36:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-25 11:36:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-25 11:36:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-25 11:36:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-25 11:36:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2023-12-25 11:36:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-25 11:36:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-25 11:36:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 11:36:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-25 11:36:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-25 11:36:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-25 11:36:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-25 11:36:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-25 11:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-25 11:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-25 11:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-25 11:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2023-12-25 11:36:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 11:36:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 11:36:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 11:36:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 11:36:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 11:36:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-25 11:36:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-25 11:36:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-25 11:36:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-25 11:36:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-25 11:36:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-25 11:36:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2023-12-25 11:36:08,336 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2023-12-25 11:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 11:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 11:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-25 11:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-25 11:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-25 11:36:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-25 11:36:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-25 11:36:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:36:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:36:08,610 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:36:08,612 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:36:08,654 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:08,655 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);#res := 0bv32; [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);push_#res#1 := 0bv32; [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);pop_#res#1 := 0bv32; [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,348 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);pop_#res#1 := 0bv32; [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);pop_#res#1 := 0bv32; [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);pop_#res#1 := 0bv32; [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0));pop_#res#1 := 0bv32; [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0);push_#res#1 := 0bv32; [2023-12-25 11:36:09,349 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,357 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0bv32 != ~zero_extend~32~8(~__CS_ret~0)); [2023-12-25 11:36:09,358 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0bv32 != ~zero_extend~32~8(~__CS_ret~0); [2023-12-25 11:36:13,801 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:36:13,835 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:36:13,836 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-25 11:36:13,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:36:13 BoogieIcfgContainer [2023-12-25 11:36:13,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:36:13,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:36:13,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:36:13,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:36:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:36:07" (1/3) ... [2023-12-25 11:36:13,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8a049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:36:13, skipping insertion in model container [2023-12-25 11:36:13,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:36:08" (2/3) ... [2023-12-25 11:36:13,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8a049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:36:13, skipping insertion in model container [2023-12-25 11:36:13,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:36:13" (3/3) ... [2023-12-25 11:36:13,858 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2023-12-25 11:36:13,871 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:36:13,871 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:36:13,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:36:13,944 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;@5f05ff5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:36:13,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:36:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-25 11:36:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-25 11:36:13,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:13,991 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] [2023-12-25 11:36:13,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:13,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash 793737601, now seen corresponding path program 1 times [2023-12-25 11:36:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368644778] [2023-12-25 11:36:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:14,006 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-25 11:36:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:14,013 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-25 11:36:14,015 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-25 11:36:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:14,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:36:14,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-12-25 11:36:14,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:14,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368644778] [2023-12-25 11:36:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368644778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:36:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889995110] [2023-12-25 11:36:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:14,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:36:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:36:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:36:14,501 INFO L87 Difference]: Start difference. First operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-25 11:36:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:14,684 INFO L93 Difference]: Finished difference Result 423 states and 762 transitions. [2023-12-25 11:36:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:36:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 95 [2023-12-25 11:36:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:14,694 INFO L225 Difference]: With dead ends: 423 [2023-12-25 11:36:14,694 INFO L226 Difference]: Without dead ends: 210 [2023-12-25 11:36:14,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-25 11:36:14,703 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:14,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 11:36:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-25 11:36:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-12-25 11:36:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 129 states have internal predecessors, (193), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-25 11:36:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 339 transitions. [2023-12-25 11:36:14,749 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 339 transitions. Word has length 95 [2023-12-25 11:36:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:14,749 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 339 transitions. [2023-12-25 11:36:14,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-25 11:36:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2023-12-25 11:36:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-25 11:36:14,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:14,755 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] [2023-12-25 11:36:14,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:14,963 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-25 11:36:14,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:14,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 179256165, now seen corresponding path program 1 times [2023-12-25 11:36:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:14,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276927454] [2023-12-25 11:36:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:14,965 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-25 11:36:14,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:14,967 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-25 11:36:14,970 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-25 11:36:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:15,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:36:15,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:15,354 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-25 11:36:15,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:15,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276927454] [2023-12-25 11:36:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276927454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:15,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:15,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:36:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884640582] [2023-12-25 11:36:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:15,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:15,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:15,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:15,357 INFO L87 Difference]: Start difference. First operand 210 states and 339 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-25 11:36:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:16,003 INFO L93 Difference]: Finished difference Result 419 states and 677 transitions. [2023-12-25 11:36:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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 95 [2023-12-25 11:36:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:16,011 INFO L225 Difference]: With dead ends: 419 [2023-12-25 11:36:16,011 INFO L226 Difference]: Without dead ends: 215 [2023-12-25 11:36:16,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:16,013 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 6 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:16,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 11:36:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-25 11:36:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2023-12-25 11:36:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.515625) internal successors, (194), 130 states have internal predecessors, (194), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-25 11:36:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 340 transitions. [2023-12-25 11:36:16,040 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 340 transitions. Word has length 95 [2023-12-25 11:36:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:16,041 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 340 transitions. [2023-12-25 11:36:16,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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-25 11:36:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2023-12-25 11:36:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 11:36:16,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:16,044 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] [2023-12-25 11:36:16,056 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-25 11:36:16,251 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-25 11:36:16,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:16,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1233001572, now seen corresponding path program 1 times [2023-12-25 11:36:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:16,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442160936] [2023-12-25 11:36:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:16,254 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-25 11:36:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:16,255 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-25 11:36:16,266 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-25 11:36:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:16,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:36:16,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-25 11:36:16,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:16,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442160936] [2023-12-25 11:36:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442160936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:16,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:36:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276313650] [2023-12-25 11:36:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:16,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:16,625 INFO L87 Difference]: Start difference. First operand 211 states and 340 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-25 11:36:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:16,881 INFO L93 Difference]: Finished difference Result 422 states and 682 transitions. [2023-12-25 11:36:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 100 [2023-12-25 11:36:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:16,887 INFO L225 Difference]: With dead ends: 422 [2023-12-25 11:36:16,887 INFO L226 Difference]: Without dead ends: 213 [2023-12-25 11:36:16,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:16,888 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:16,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:36:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-25 11:36:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-12-25 11:36:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 132 states have internal predecessors, (196), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-25 11:36:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2023-12-25 11:36:16,906 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 100 [2023-12-25 11:36:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:16,907 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2023-12-25 11:36:16,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-25 11:36:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2023-12-25 11:36:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 11:36:16,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:16,912 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] [2023-12-25 11:36:16,921 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-25 11:36:17,119 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-25 11:36:17,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:17,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash -631579465, now seen corresponding path program 1 times [2023-12-25 11:36:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187049513] [2023-12-25 11:36:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:17,121 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-25 11:36:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:17,123 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-25 11:36:17,160 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-25 11:36:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:17,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:36:17,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-25 11:36:17,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-25 11:36:17,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187049513] [2023-12-25 11:36:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187049513] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:17,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:17,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 11:36:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398459320] [2023-12-25 11:36:17,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:17,696 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-25 11:36:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:18,439 INFO L93 Difference]: Finished difference Result 428 states and 690 transitions. [2023-12-25 11:36:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 102 [2023-12-25 11:36:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:18,462 INFO L225 Difference]: With dead ends: 428 [2023-12-25 11:36:18,462 INFO L226 Difference]: Without dead ends: 217 [2023-12-25 11:36:18,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:18,464 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:18,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1629 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 11:36:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-25 11:36:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-12-25 11:36:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 134 states have (on average 1.492537313432836) internal successors, (200), 136 states have internal predecessors, (200), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-12-25 11:36:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 346 transitions. [2023-12-25 11:36:18,475 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 346 transitions. Word has length 102 [2023-12-25 11:36:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 346 transitions. [2023-12-25 11:36:18,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-25 11:36:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 346 transitions. [2023-12-25 11:36:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 11:36:18,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:18,477 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:18,492 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-25 11:36:18,684 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-25 11:36:18,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:18,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 903316247, now seen corresponding path program 2 times [2023-12-25 11:36:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961153635] [2023-12-25 11:36:18,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:36:18,686 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-25 11:36:18,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:18,688 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-25 11:36:18,722 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-25 11:36:18,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:36:18,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:36:18,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:36:18,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2023-12-25 11:36:20,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:20,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961153635] [2023-12-25 11:36:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961153635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:36:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431023914] [2023-12-25 11:36:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:20,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:36:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:36:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:36:20,203 INFO L87 Difference]: Start difference. First operand 217 states and 346 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-25 11:36:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:20,578 INFO L93 Difference]: Finished difference Result 418 states and 680 transitions. [2023-12-25 11:36:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 11:36:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 106 [2023-12-25 11:36:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:20,582 INFO L225 Difference]: With dead ends: 418 [2023-12-25 11:36:20,582 INFO L226 Difference]: Without dead ends: 384 [2023-12-25 11:36:20,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:20,583 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 273 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:20,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1019 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 11:36:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-25 11:36:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2023-12-25 11:36:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 234 states have (on average 1.5384615384615385) internal successors, (360), 238 states have internal predecessors, (360), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2023-12-25 11:36:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 630 transitions. [2023-12-25 11:36:20,617 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 630 transitions. Word has length 106 [2023-12-25 11:36:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 630 transitions. [2023-12-25 11:36:20,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-25 11:36:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 630 transitions. [2023-12-25 11:36:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-25 11:36:20,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:20,622 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:20,629 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-25 11:36:20,830 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-25 11:36:20,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:20,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2137871054, now seen corresponding path program 1 times [2023-12-25 11:36:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761552369] [2023-12-25 11:36:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:20,832 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-25 11:36:20,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:20,836 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-25 11:36:20,838 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-25 11:36:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:21,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 11:36:21,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-12-25 11:36:21,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-12-25 11:36:21,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761552369] [2023-12-25 11:36:21,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761552369] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:21,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 11:36:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138566201] [2023-12-25 11:36:21,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:21,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 11:36:21,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 11:36:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:36:21,952 INFO L87 Difference]: Start difference. First operand 384 states and 630 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-25 11:36:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:23,548 INFO L93 Difference]: Finished difference Result 768 states and 1262 transitions. [2023-12-25 11:36:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:36:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 182 [2023-12-25 11:36:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:23,552 INFO L225 Difference]: With dead ends: 768 [2023-12-25 11:36:23,552 INFO L226 Difference]: Without dead ends: 386 [2023-12-25 11:36:23,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:36:23,557 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 2 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:23,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2278 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 11:36:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-25 11:36:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-12-25 11:36:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 236 states have (on average 1.5296610169491525) internal successors, (361), 240 states have internal predecessors, (361), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2023-12-25 11:36:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 631 transitions. [2023-12-25 11:36:23,589 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 631 transitions. Word has length 182 [2023-12-25 11:36:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:23,589 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 631 transitions. [2023-12-25 11:36:23,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2023-12-25 11:36:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 631 transitions. [2023-12-25 11:36:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-25 11:36:23,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:23,592 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:23,606 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-25 11:36:23,801 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-25 11:36:23,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:23,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash -138669575, now seen corresponding path program 1 times [2023-12-25 11:36:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793483962] [2023-12-25 11:36:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:23,803 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-25 11:36:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:23,805 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-25 11:36:23,832 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-25 11:36:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:24,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 11:36:24,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2023-12-25 11:36:24,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2023-12-25 11:36:24,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793483962] [2023-12-25 11:36:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793483962] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:24,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-25 11:36:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526655143] [2023-12-25 11:36:24,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:24,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:24,806 INFO L87 Difference]: Start difference. First operand 386 states and 631 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-12-25 11:36:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:25,989 INFO L93 Difference]: Finished difference Result 782 states and 1273 transitions. [2023-12-25 11:36:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 181 [2023-12-25 11:36:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:25,993 INFO L225 Difference]: With dead ends: 782 [2023-12-25 11:36:25,993 INFO L226 Difference]: Without dead ends: 411 [2023-12-25 11:36:25,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:25,997 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 17 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:25,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 985 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 11:36:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-25 11:36:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 399. [2023-12-25 11:36:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 253 states have internal predecessors, (375), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2023-12-25 11:36:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 645 transitions. [2023-12-25 11:36:26,027 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 645 transitions. Word has length 181 [2023-12-25 11:36:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:26,027 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 645 transitions. [2023-12-25 11:36:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-12-25 11:36:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 645 transitions. [2023-12-25 11:36:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-25 11:36:26,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:26,032 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:26,064 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-25 11:36:26,248 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-25 11:36:26,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:26,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 980289067, now seen corresponding path program 2 times [2023-12-25 11:36:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609363949] [2023-12-25 11:36:26,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 11:36:26,250 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-25 11:36:26,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:26,251 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-25 11:36:26,252 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-25 11:36:26,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 11:36:26,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 11:36:26,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 11:36:26,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-12-25 11:36:26,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:26,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609363949] [2023-12-25 11:36:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609363949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:36:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136789510] [2023-12-25 11:36:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:26,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:36:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:36:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:26,699 INFO L87 Difference]: Start difference. First operand 399 states and 645 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-25 11:36:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:26,929 INFO L93 Difference]: Finished difference Result 760 states and 1242 transitions. [2023-12-25 11:36:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:36:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 194 [2023-12-25 11:36:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:26,933 INFO L225 Difference]: With dead ends: 760 [2023-12-25 11:36:26,934 INFO L226 Difference]: Without dead ends: 399 [2023-12-25 11:36:26,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:36:26,936 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:26,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:36:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-25 11:36:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2023-12-25 11:36:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 249 states have (on average 1.502008032128514) internal successors, (374), 253 states have internal predecessors, (374), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2023-12-25 11:36:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 644 transitions. [2023-12-25 11:36:26,953 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 644 transitions. Word has length 194 [2023-12-25 11:36:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:26,954 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 644 transitions. [2023-12-25 11:36:26,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-12-25 11:36:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 644 transitions. [2023-12-25 11:36:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-25 11:36:26,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:26,958 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:26,984 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 11:36:27,168 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-25 11:36:27,169 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:27,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1316560700, now seen corresponding path program 1 times [2023-12-25 11:36:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32943801] [2023-12-25 11:36:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:27,170 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-25 11:36:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:27,171 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-25 11:36:27,172 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-25 11:36:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:27,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 11:36:27,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 336 proven. 7 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2023-12-25 11:36:28,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:36:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2023-12-25 11:36:29,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32943801] [2023-12-25 11:36:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32943801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:36:29,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:36:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2023-12-25 11:36:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902432079] [2023-12-25 11:36:29,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:36:29,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:36:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:36:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:36:29,961 INFO L87 Difference]: Start difference. First operand 399 states and 644 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2023-12-25 11:36:34,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:43,018 INFO L93 Difference]: Finished difference Result 1496 states and 2479 transitions. [2023-12-25 11:36:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 11:36:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) Word has length 215 [2023-12-25 11:36:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:43,042 INFO L225 Difference]: With dead ends: 1496 [2023-12-25 11:36:43,042 INFO L226 Difference]: Without dead ends: 1128 [2023-12-25 11:36:43,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-25 11:36:43,045 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 933 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 616 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:43,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 928 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 779 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2023-12-25 11:36:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2023-12-25 11:36:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1114. [2023-12-25 11:36:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 673 states have (on average 1.5185735512630014) internal successors, (1022), 689 states have internal predecessors, (1022), 380 states have call successors, (380), 58 states have call predecessors, (380), 60 states have return successors, (424), 378 states have call predecessors, (424), 380 states have call successors, (424) [2023-12-25 11:36:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1826 transitions. [2023-12-25 11:36:43,098 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1826 transitions. Word has length 215 [2023-12-25 11:36:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:43,099 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1826 transitions. [2023-12-25 11:36:43,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2023-12-25 11:36:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1826 transitions. [2023-12-25 11:36:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-25 11:36:43,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:43,106 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:43,120 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-25 11:36:43,319 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-25 11:36:43,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:43,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -474037116, now seen corresponding path program 1 times [2023-12-25 11:36:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984983411] [2023-12-25 11:36:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:43,321 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-25 11:36:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:43,322 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-25 11:36:43,323 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-25 11:36:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:43,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:36:43,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:43,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-25 11:36:43,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-25 11:36:44,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:36:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:36:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-12-25 11:36:44,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:44,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984983411] [2023-12-25 11:36:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984983411] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:44,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 11:36:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829260585] [2023-12-25 11:36:44,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:44,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 11:36:44,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 11:36:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 11:36:44,282 INFO L87 Difference]: Start difference. First operand 1114 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:36:48,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:36:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:36:51,699 INFO L93 Difference]: Finished difference Result 2193 states and 3591 transitions. [2023-12-25 11:36:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 11:36:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 213 [2023-12-25 11:36:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:36:51,707 INFO L225 Difference]: With dead ends: 2193 [2023-12-25 11:36:51,707 INFO L226 Difference]: Without dead ends: 1125 [2023-12-25 11:36:51,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 11:36:51,713 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 424 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 85 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:36:51,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 775 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2023-12-25 11:36:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-12-25 11:36:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1115. [2023-12-25 11:36:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 672 states have (on average 1.5163690476190477) internal successors, (1019), 691 states have internal predecessors, (1019), 379 states have call successors, (379), 58 states have call predecessors, (379), 63 states have return successors, (423), 377 states have call predecessors, (423), 379 states have call successors, (423) [2023-12-25 11:36:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1821 transitions. [2023-12-25 11:36:51,781 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1821 transitions. Word has length 213 [2023-12-25 11:36:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:36:51,781 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1821 transitions. [2023-12-25 11:36:51,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:36:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1821 transitions. [2023-12-25 11:36:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-25 11:36:51,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:36:51,788 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:36:51,803 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-25 11:36:52,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-25 11:36:52,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:36:52,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:36:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash -5662161, now seen corresponding path program 1 times [2023-12-25 11:36:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:36:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571670852] [2023-12-25 11:36:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:36:52,002 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-25 11:36:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:36:52,003 INFO L229 MonitoredProcess]: Starting monitored process 12 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-25 11:36:52,004 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 (12)] Waiting until timeout for monitored process [2023-12-25 11:36:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:36:52,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 11:36:52,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:36:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-12-25 11:36:54,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:36:54,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:36:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571670852] [2023-12-25 11:36:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571670852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:36:54,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:36:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 11:36:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481646482] [2023-12-25 11:36:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:36:54,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:36:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:36:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:36:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:36:54,133 INFO L87 Difference]: Start difference. First operand 1115 states and 1821 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-25 11:37:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:00,880 INFO L93 Difference]: Finished difference Result 2939 states and 4830 transitions. [2023-12-25 11:37:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:37:00,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 212 [2023-12-25 11:37:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:00,890 INFO L225 Difference]: With dead ends: 2939 [2023-12-25 11:37:00,890 INFO L226 Difference]: Without dead ends: 1865 [2023-12-25 11:37:00,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-12-25 11:37:00,896 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 627 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:00,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 412 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-25 11:37:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2023-12-25 11:37:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1711. [2023-12-25 11:37:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1028 states have (on average 1.456225680933852) internal successors, (1497), 1051 states have internal predecessors, (1497), 575 states have call successors, (575), 74 states have call predecessors, (575), 107 states have return successors, (711), 603 states have call predecessors, (711), 575 states have call successors, (711) [2023-12-25 11:37:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2783 transitions. [2023-12-25 11:37:01,078 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2783 transitions. Word has length 212 [2023-12-25 11:37:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:01,079 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2783 transitions. [2023-12-25 11:37:01,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2023-12-25 11:37:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2783 transitions. [2023-12-25 11:37:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-25 11:37:01,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:01,088 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:37:01,106 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-25 11:37:01,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:01,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash -551007247, now seen corresponding path program 1 times [2023-12-25 11:37:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830869717] [2023-12-25 11:37:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:01,306 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-25 11:37:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:01,307 INFO L229 MonitoredProcess]: Starting monitored process 13 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-25 11:37:01,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 (13)] Waiting until timeout for monitored process [2023-12-25 11:37:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:02,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 11:37:02,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-12-25 11:37:03,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:03,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830869717] [2023-12-25 11:37:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830869717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 11:37:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321388699] [2023-12-25 11:37:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 11:37:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 11:37:03,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:37:03,501 INFO L87 Difference]: Start difference. First operand 1711 states and 2783 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2023-12-25 11:37:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:13,404 INFO L93 Difference]: Finished difference Result 4043 states and 6521 transitions. [2023-12-25 11:37:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 11:37:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 212 [2023-12-25 11:37:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:13,415 INFO L225 Difference]: With dead ends: 4043 [2023-12-25 11:37:13,415 INFO L226 Difference]: Without dead ends: 2377 [2023-12-25 11:37:13,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:37:13,423 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 747 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:13,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 680 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-12-25 11:37:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2023-12-25 11:37:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2261. [2023-12-25 11:37:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1371 states have (on average 1.3668854850474106) internal successors, (1874), 1428 states have internal predecessors, (1874), 740 states have call successors, (740), 106 states have call predecessors, (740), 149 states have return successors, (923), 750 states have call predecessors, (923), 740 states have call successors, (923) [2023-12-25 11:37:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3537 transitions. [2023-12-25 11:37:13,618 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3537 transitions. Word has length 212 [2023-12-25 11:37:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:13,618 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3537 transitions. [2023-12-25 11:37:13,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2023-12-25 11:37:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3537 transitions. [2023-12-25 11:37:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-25 11:37:13,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:13,628 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:37:13,650 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:13,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-25 11:37:13,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:13,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1820709619, now seen corresponding path program 1 times [2023-12-25 11:37:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227355217] [2023-12-25 11:37:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:13,852 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-25 11:37:13,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:13,853 INFO L229 MonitoredProcess]: Starting monitored process 14 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-25 11:37:13,854 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 (14)] Waiting until timeout for monitored process [2023-12-25 11:37:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:16,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:16,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:16,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2023-12-25 11:37:16,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:16,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:37:16,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:16,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:37:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-12-25 11:37:16,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:16,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227355217] [2023-12-25 11:37:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227355217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:37:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925697443] [2023-12-25 11:37:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:16,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:37:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:37:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:37:16,948 INFO L87 Difference]: Start difference. First operand 2261 states and 3537 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:37:21,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:25,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:29,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:35,770 INFO L93 Difference]: Finished difference Result 3029 states and 4632 transitions. [2023-12-25 11:37:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:37:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 212 [2023-12-25 11:37:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:35,781 INFO L225 Difference]: With dead ends: 3029 [2023-12-25 11:37:35,781 INFO L226 Difference]: Without dead ends: 2015 [2023-12-25 11:37:35,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:37:35,785 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 573 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 387 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:35,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 823 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 481 Invalid, 3 Unknown, 0 Unchecked, 18.5s Time] [2023-12-25 11:37:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2023-12-25 11:37:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2011. [2023-12-25 11:37:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1217 states have (on average 1.3344289235825801) internal successors, (1624), 1265 states have internal predecessors, (1624), 661 states have call successors, (661), 96 states have call predecessors, (661), 132 states have return successors, (812), 669 states have call predecessors, (812), 661 states have call successors, (812) [2023-12-25 11:37:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3097 transitions. [2023-12-25 11:37:35,954 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 3097 transitions. Word has length 212 [2023-12-25 11:37:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:35,954 INFO L495 AbstractCegarLoop]: Abstraction has 2011 states and 3097 transitions. [2023-12-25 11:37:35,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:37:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 3097 transitions. [2023-12-25 11:37:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-25 11:37:35,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:35,962 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:37:35,981 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:36,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-25 11:37:36,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:36,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1330595805, now seen corresponding path program 1 times [2023-12-25 11:37:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302582696] [2023-12-25 11:37:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:37:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:36,179 INFO L229 MonitoredProcess]: Starting monitored process 15 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-25 11:37:36,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 11:37:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:37:38,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 11:37:38,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:37:38,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2023-12-25 11:37:38,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:38,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:37:39,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:37:39,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:37:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-12-25 11:37:39,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:37:39,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:37:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302582696] [2023-12-25 11:37:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302582696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:37:39,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:37:39,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 11:37:39,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28069040] [2023-12-25 11:37:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:37:39,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 11:37:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:37:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 11:37:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 11:37:39,133 INFO L87 Difference]: Start difference. First operand 2011 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:37:43,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:47,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:51,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:54,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:37:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:37:58,984 INFO L93 Difference]: Finished difference Result 3701 states and 5652 transitions. [2023-12-25 11:37:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 11:37:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 212 [2023-12-25 11:37:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:37:58,993 INFO L225 Difference]: With dead ends: 3701 [2023-12-25 11:37:58,994 INFO L226 Difference]: Without dead ends: 1612 [2023-12-25 11:37:59,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-25 11:37:59,000 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 465 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 343 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-12-25 11:37:59,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 842 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 447 Invalid, 3 Unknown, 0 Unchecked, 19.5s Time] [2023-12-25 11:37:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2023-12-25 11:37:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2023-12-25 11:37:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 986 states have (on average 1.354969574036511) internal successors, (1336), 1021 states have internal predecessors, (1336), 515 states have call successors, (515), 80 states have call predecessors, (515), 110 states have return successors, (647), 526 states have call predecessors, (647), 515 states have call successors, (647) [2023-12-25 11:37:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2498 transitions. [2023-12-25 11:37:59,140 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2498 transitions. Word has length 212 [2023-12-25 11:37:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:37:59,141 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 2498 transitions. [2023-12-25 11:37:59,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2023-12-25 11:37:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2498 transitions. [2023-12-25 11:37:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-12-25 11:37:59,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:37:59,148 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:37:59,168 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 11:37:59,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-25 11:37:59,364 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:37:59,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:37:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -722934082, now seen corresponding path program 1 times [2023-12-25 11:37:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:37:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964370541] [2023-12-25 11:37:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:37:59,366 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-25 11:37:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:37:59,367 INFO L229 MonitoredProcess]: Starting monitored process 16 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-25 11:37:59,384 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 (16)] Waiting until timeout for monitored process [2023-12-25 11:38:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:00,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 11:38:00,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:02,220 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 13 treesize of output 9 [2023-12-25 11:38:03,910 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 17 treesize of output 9 [2023-12-25 11:38:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-25 11:38:04,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:38:04,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:38:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964370541] [2023-12-25 11:38:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964370541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:38:04,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:38:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 11:38:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955579578] [2023-12-25 11:38:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:38:04,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 11:38:04,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:38:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 11:38:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 11:38:04,025 INFO L87 Difference]: Start difference. First operand 1612 states and 2498 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 7 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2023-12-25 11:38:08,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:12,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:16,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:20,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:24,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:28,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:32,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:38:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:38:54,619 INFO L93 Difference]: Finished difference Result 2536 states and 3957 transitions. [2023-12-25 11:38:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 11:38:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 7 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 197 [2023-12-25 11:38:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:38:54,631 INFO L225 Difference]: With dead ends: 2536 [2023-12-25 11:38:54,632 INFO L226 Difference]: Without dead ends: 2365 [2023-12-25 11:38:54,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-25 11:38:54,634 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 650 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 553 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:38:54,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 2186 Invalid, 2731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [553 Valid, 2171 Invalid, 7 Unknown, 0 Unchecked, 49.3s Time] [2023-12-25 11:38:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2023-12-25 11:38:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2341. [2023-12-25 11:38:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 1415 states have (on average 1.3385159010600707) internal successors, (1894), 1470 states have internal predecessors, (1894), 766 states have call successors, (766), 108 states have call predecessors, (766), 159 states have return successors, (1000), 784 states have call predecessors, (1000), 766 states have call successors, (1000) [2023-12-25 11:38:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3660 transitions. [2023-12-25 11:38:54,892 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3660 transitions. Word has length 197 [2023-12-25 11:38:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:38:54,893 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3660 transitions. [2023-12-25 11:38:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 7 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2023-12-25 11:38:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3660 transitions. [2023-12-25 11:38:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-25 11:38:54,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:38:54,905 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 8, 8, 8, 8, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:38:54,925 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 11:38:55,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-25 11:38:55,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:38:55,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:38:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1488785478, now seen corresponding path program 1 times [2023-12-25 11:38:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:38:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894697676] [2023-12-25 11:38:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:38:55,115 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-25 11:38:55,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:38:55,116 INFO L229 MonitoredProcess]: Starting monitored process 17 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-25 11:38:55,118 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 (17)] Waiting until timeout for monitored process [2023-12-25 11:38:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:38:56,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 11:38:56,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:38:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 448 proven. 7 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-12-25 11:38:57,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2023-12-25 11:39:00,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894697676] [2023-12-25 11:39:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894697676] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:39:00,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:39:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2023-12-25 11:39:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254146252] [2023-12-25 11:39:00,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:39:00,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 11:39:00,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:00,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 11:39:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-25 11:39:00,594 INFO L87 Difference]: Start difference. First operand 2341 states and 3660 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 11 states have call successors, (50), 6 states have call predecessors, (50), 7 states have return successors, (49), 10 states have call predecessors, (49), 11 states have call successors, (49) [2023-12-25 11:39:05,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:09,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:13,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:17,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:21,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:25,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:29,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:39,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:39:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:39:46,792 INFO L93 Difference]: Finished difference Result 3692 states and 5552 transitions. [2023-12-25 11:39:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 11:39:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 11 states have call successors, (50), 6 states have call predecessors, (50), 7 states have return successors, (49), 10 states have call predecessors, (49), 11 states have call successors, (49) Word has length 241 [2023-12-25 11:39:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:39:46,803 INFO L225 Difference]: With dead ends: 3692 [2023-12-25 11:39:46,803 INFO L226 Difference]: Without dead ends: 2577 [2023-12-25 11:39:46,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 471 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-12-25 11:39:46,807 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 1382 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 1030 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1030 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:39:46,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 1564 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1030 Valid, 1580 Invalid, 7 Unknown, 0 Unchecked, 44.9s Time] [2023-12-25 11:39:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2023-12-25 11:39:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2237. [2023-12-25 11:39:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1352 states have (on average 1.3180473372781065) internal successors, (1782), 1409 states have internal predecessors, (1782), 713 states have call successors, (713), 120 states have call predecessors, (713), 171 states have return successors, (898), 727 states have call predecessors, (898), 713 states have call successors, (898) [2023-12-25 11:39:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3393 transitions. [2023-12-25 11:39:47,044 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3393 transitions. Word has length 241 [2023-12-25 11:39:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:39:47,044 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 3393 transitions. [2023-12-25 11:39:47,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 11 states have call successors, (50), 6 states have call predecessors, (50), 7 states have return successors, (49), 10 states have call predecessors, (49), 11 states have call successors, (49) [2023-12-25 11:39:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3393 transitions. [2023-12-25 11:39:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-25 11:39:47,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:39:47,055 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:39:47,074 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 11:39:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-25 11:39:47,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:39:47,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:39:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2017010440, now seen corresponding path program 1 times [2023-12-25 11:39:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:39:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125572860] [2023-12-25 11:39:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:39:47,274 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-25 11:39:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:39:47,275 INFO L229 MonitoredProcess]: Starting monitored process 18 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-25 11:39:47,277 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 (18)] Waiting until timeout for monitored process [2023-12-25 11:39:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:39:48,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 11:39:48,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:39:48,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:39:50,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:39:50,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-12-25 11:39:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 387 proven. 23 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2023-12-25 11:39:50,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:39:50,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-25 11:39:51,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:39:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:39:52,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:39:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2023-12-25 11:39:53,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:39:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125572860] [2023-12-25 11:39:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125572860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:39:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:39:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-25 11:39:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372470218] [2023-12-25 11:39:53,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:39:53,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 11:39:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:39:53,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 11:39:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-25 11:39:53,567 INFO L87 Difference]: Start difference. First operand 2237 states and 3393 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 13 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) [2023-12-25 11:39:58,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:02,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:06,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:10,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:14,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:18,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:22,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:26,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:30,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:34,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:38,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:40:42,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:41:32,947 INFO L93 Difference]: Finished difference Result 4120 states and 6241 transitions. [2023-12-25 11:41:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-25 11:41:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 13 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) Word has length 215 [2023-12-25 11:41:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:41:32,962 INFO L225 Difference]: With dead ends: 4120 [2023-12-25 11:41:32,962 INFO L226 Difference]: Without dead ends: 3717 [2023-12-25 11:41:32,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 11:41:32,965 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 1444 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 4163 mSolverCounterSat, 1027 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 5202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1027 IncrementalHoareTripleChecker+Valid, 4163 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.0s IncrementalHoareTripleChecker+Time [2023-12-25 11:41:32,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 3537 Invalid, 5202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1027 Valid, 4163 Invalid, 12 Unknown, 0 Unchecked, 93.0s Time] [2023-12-25 11:41:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2023-12-25 11:41:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3671. [2023-12-25 11:41:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2196 states have (on average 1.2991803278688525) internal successors, (2853), 2288 states have internal predecessors, (2853), 1208 states have call successors, (1208), 189 states have call predecessors, (1208), 266 states have return successors, (1495), 1225 states have call predecessors, (1495), 1208 states have call successors, (1495) [2023-12-25 11:41:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5556 transitions. [2023-12-25 11:41:33,367 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5556 transitions. Word has length 215 [2023-12-25 11:41:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:41:33,367 INFO L495 AbstractCegarLoop]: Abstraction has 3671 states and 5556 transitions. [2023-12-25 11:41:33,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 13 states have call successors, (51), 6 states have call predecessors, (51), 10 states have return successors, (51), 12 states have call predecessors, (51), 13 states have call successors, (51) [2023-12-25 11:41:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5556 transitions. [2023-12-25 11:41:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-25 11:41:33,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:41:33,380 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:41:33,395 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 11:41:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-25 11:41:33,596 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:41:33,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:41:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash -176454371, now seen corresponding path program 1 times [2023-12-25 11:41:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:41:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806510483] [2023-12-25 11:41:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:41:33,597 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-25 11:41:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:41:33,598 INFO L229 MonitoredProcess]: Starting monitored process 19 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-25 11:41:33,600 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 (19)] Waiting until timeout for monitored process [2023-12-25 11:41:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:41:34,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 11:41:34,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:41:35,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:41:35,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:41:37,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:41:37,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:41:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 387 proven. 20 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2023-12-25 11:41:37,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:41:38,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2023-12-25 11:41:38,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2023-12-25 11:41:39,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2023-12-25 11:41:40,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2023-12-25 11:41:41,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 22 [2023-12-25 11:41:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2023-12-25 11:41:42,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:41:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806510483] [2023-12-25 11:41:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806510483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:41:42,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:41:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2023-12-25 11:41:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856875061] [2023-12-25 11:41:42,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:41:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 11:41:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:41:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 11:41:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-25 11:41:42,555 INFO L87 Difference]: Start difference. First operand 3671 states and 5556 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 12 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 11 states have call predecessors, (50), 12 states have call successors, (50) [2023-12-25 11:41:47,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:51,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:55,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:41:59,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:03,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:07,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:11,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:15,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:19,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:23,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:27,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:42:31,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:43:20,221 INFO L93 Difference]: Finished difference Result 3870 states and 5821 transitions. [2023-12-25 11:43:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-25 11:43:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 12 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 11 states have call predecessors, (50), 12 states have call successors, (50) Word has length 216 [2023-12-25 11:43:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:43:20,243 INFO L225 Difference]: With dead ends: 3870 [2023-12-25 11:43:20,243 INFO L226 Difference]: Without dead ends: 3764 [2023-12-25 11:43:20,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=407, Invalid=1945, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 11:43:20,247 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1550 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 3936 mSolverCounterSat, 1134 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 5082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1134 IncrementalHoareTripleChecker+Valid, 3936 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.9s IncrementalHoareTripleChecker+Time [2023-12-25 11:43:20,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 3143 Invalid, 5082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1134 Valid, 3936 Invalid, 12 Unknown, 0 Unchecked, 90.9s Time] [2023-12-25 11:43:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2023-12-25 11:43:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3679. [2023-12-25 11:43:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2200 states have (on average 1.2986363636363636) internal successors, (2857), 2296 states have internal predecessors, (2857), 1208 states have call successors, (1208), 189 states have call predecessors, (1208), 270 states have return successors, (1502), 1225 states have call predecessors, (1502), 1208 states have call successors, (1502) [2023-12-25 11:43:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 5567 transitions. [2023-12-25 11:43:20,662 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 5567 transitions. Word has length 216 [2023-12-25 11:43:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:43:20,663 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 5567 transitions. [2023-12-25 11:43:20,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 12 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 11 states have call predecessors, (50), 12 states have call successors, (50) [2023-12-25 11:43:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 5567 transitions. [2023-12-25 11:43:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-25 11:43:20,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:43:20,676 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:43:20,694 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 (19)] Forceful destruction successful, exit code 0 [2023-12-25 11:43:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-25 11:43:20,884 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:43:20,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:43:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 98554148, now seen corresponding path program 1 times [2023-12-25 11:43:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:43:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516367235] [2023-12-25 11:43:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:43:20,886 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-25 11:43:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:43:20,887 INFO L229 MonitoredProcess]: Starting monitored process 20 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-25 11:43:20,908 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 (20)] Waiting until timeout for monitored process [2023-12-25 11:43:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:43:23,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 11:43:23,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:43:24,810 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 13 treesize of output 9 [2023-12-25 11:43:25,581 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 11 treesize of output 4 [2023-12-25 11:43:26,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:43:26,076 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 24 [2023-12-25 11:43:28,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:43:28,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2023-12-25 11:43:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 392 proven. 59 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2023-12-25 11:43:29,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:43:30,193 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 30 treesize of output 28 [2023-12-25 11:43:30,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 36 [2023-12-25 11:43:32,454 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 30 treesize of output 28 [2023-12-25 11:43:32,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 36 [2023-12-25 11:43:32,857 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 30 treesize of output 28 [2023-12-25 11:43:32,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40 treesize of output 36 [2023-12-25 11:43:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2023-12-25 11:43:33,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:43:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516367235] [2023-12-25 11:43:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516367235] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:43:33,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:43:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2023-12-25 11:43:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667403083] [2023-12-25 11:43:33,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:43:33,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 11:43:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:43:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 11:43:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-12-25 11:43:33,437 INFO L87 Difference]: Start difference. First operand 3679 states and 5567 transitions. Second operand has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 13 states have call successors, (55), 9 states have call predecessors, (55), 11 states have return successors, (55), 13 states have call predecessors, (55), 13 states have call successors, (55) [2023-12-25 11:43:39,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:43,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:47,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:51,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:55,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:43:59,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:03,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:07,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:11,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:15,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:19,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:27,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:44:31,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:45:08,366 INFO L93 Difference]: Finished difference Result 5273 states and 7870 transitions. [2023-12-25 11:45:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 11:45:08,367 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 13 states have call successors, (55), 9 states have call predecessors, (55), 11 states have return successors, (55), 13 states have call predecessors, (55), 13 states have call successors, (55) Word has length 216 [2023-12-25 11:45:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:45:08,378 INFO L225 Difference]: With dead ends: 5273 [2023-12-25 11:45:08,378 INFO L226 Difference]: Without dead ends: 3685 [2023-12-25 11:45:08,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 413 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 11:45:08,383 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 1331 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 1189 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 4229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1189 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.1s IncrementalHoareTripleChecker+Time [2023-12-25 11:45:08,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2732 Invalid, 4229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1189 Valid, 3026 Invalid, 14 Unknown, 0 Unchecked, 92.1s Time] [2023-12-25 11:45:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2023-12-25 11:45:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3679. [2023-12-25 11:45:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2200 states have (on average 1.2972727272727274) internal successors, (2854), 2296 states have internal predecessors, (2854), 1208 states have call successors, (1208), 189 states have call predecessors, (1208), 270 states have return successors, (1502), 1225 states have call predecessors, (1502), 1208 states have call successors, (1502) [2023-12-25 11:45:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 5564 transitions. [2023-12-25 11:45:08,874 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 5564 transitions. Word has length 216 [2023-12-25 11:45:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:45:08,874 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 5564 transitions. [2023-12-25 11:45:08,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 22 states have internal predecessors, (137), 13 states have call successors, (55), 9 states have call predecessors, (55), 11 states have return successors, (55), 13 states have call predecessors, (55), 13 states have call successors, (55) [2023-12-25 11:45:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 5564 transitions. [2023-12-25 11:45:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-25 11:45:08,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:45:08,885 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 10, 9, 9, 9, 9, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:45:08,914 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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 11:45:09,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-25 11:45:09,104 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:45:09,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:45:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2049191541, now seen corresponding path program 1 times [2023-12-25 11:45:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:45:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077475399] [2023-12-25 11:45:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:45:09,106 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-25 11:45:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:45:09,107 INFO L229 MonitoredProcess]: Starting monitored process 21 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-25 11:45:09,120 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 (21)] Waiting until timeout for monitored process [2023-12-25 11:45:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:45:10,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 11:45:10,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:45:10,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:45:11,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:45:11,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-12-25 11:45:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 408 proven. 15 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2023-12-25 11:45:11,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:45:12,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-25 11:45:12,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:45:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:45:13,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:45:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2023-12-25 11:45:14,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:45:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077475399] [2023-12-25 11:45:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077475399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:45:14,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:45:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-25 11:45:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387738140] [2023-12-25 11:45:14,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:45:14,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:45:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:45:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:45:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:45:14,456 INFO L87 Difference]: Start difference. First operand 3679 states and 5564 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:45:18,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:23,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:27,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:31,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:35,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:39,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:43,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:45:47,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:46:18,528 INFO L93 Difference]: Finished difference Result 5311 states and 7920 transitions. [2023-12-25 11:46:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 11:46:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) Word has length 256 [2023-12-25 11:46:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:46:18,538 INFO L225 Difference]: With dead ends: 5311 [2023-12-25 11:46:18,538 INFO L226 Difference]: Without dead ends: 3156 [2023-12-25 11:46:18,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 11:46:18,544 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 1144 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 857 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 3737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 857 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:46:18,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 2268 Invalid, 3737 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [857 Valid, 2872 Invalid, 8 Unknown, 0 Unchecked, 60.2s Time] [2023-12-25 11:46:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2023-12-25 11:46:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3117. [2023-12-25 11:46:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 1881 states have (on average 1.3141945773524721) internal successors, (2472), 1958 states have internal predecessors, (2472), 999 states have call successors, (999), 167 states have call predecessors, (999), 236 states have return successors, (1254), 1019 states have call predecessors, (1254), 999 states have call successors, (1254) [2023-12-25 11:46:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4725 transitions. [2023-12-25 11:46:18,992 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4725 transitions. Word has length 256 [2023-12-25 11:46:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:46:18,992 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4725 transitions. [2023-12-25 11:46:18,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:46:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4725 transitions. [2023-12-25 11:46:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-25 11:46:19,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:46:19,001 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 10, 9, 9, 9, 9, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:46:19,019 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 11:46:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-25 11:46:19,216 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:46:19,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:46:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -378697069, now seen corresponding path program 1 times [2023-12-25 11:46:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:46:19,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358971671] [2023-12-25 11:46:19,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:46:19,218 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-25 11:46:19,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:46:19,221 INFO L229 MonitoredProcess]: Starting monitored process 22 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-25 11:46:19,240 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 (22)] Waiting until timeout for monitored process [2023-12-25 11:46:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:46:20,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 11:46:20,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:46:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:46:21,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-25 11:46:21,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-12-25 11:46:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 412 proven. 12 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2023-12-25 11:46:21,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:46:22,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-12-25 11:46:22,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:46:23,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:46:23,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-12-25 11:46:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2023-12-25 11:46:24,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:46:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358971671] [2023-12-25 11:46:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358971671] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:46:24,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:46:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-25 11:46:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724318060] [2023-12-25 11:46:24,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:46:24,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:46:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:46:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:46:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:46:24,373 INFO L87 Difference]: Start difference. First operand 3117 states and 4725 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:46:28,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:32,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:36,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:44,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:48,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:52,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:46:56,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:47:31,804 INFO L93 Difference]: Finished difference Result 3821 states and 5800 transitions. [2023-12-25 11:47:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 11:47:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) Word has length 257 [2023-12-25 11:47:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:47:31,814 INFO L225 Difference]: With dead ends: 3821 [2023-12-25 11:47:31,814 INFO L226 Difference]: Without dead ends: 3158 [2023-12-25 11:47:31,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 506 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 11:47:31,818 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 1349 mSDsluCounter, 2317 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 1017 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 4221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:47:31,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 2650 Invalid, 4221 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1017 Valid, 3196 Invalid, 8 Unknown, 0 Unchecked, 64.3s Time] [2023-12-25 11:47:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2023-12-25 11:47:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3102. [2023-12-25 11:47:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3102 states, 1870 states have (on average 1.3058823529411765) internal successors, (2442), 1950 states have internal predecessors, (2442), 992 states have call successors, (992), 167 states have call predecessors, (992), 239 states have return successors, (1250), 1011 states have call predecessors, (1250), 992 states have call successors, (1250) [2023-12-25 11:47:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4684 transitions. [2023-12-25 11:47:32,258 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4684 transitions. Word has length 257 [2023-12-25 11:47:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:47:32,259 INFO L495 AbstractCegarLoop]: Abstraction has 3102 states and 4684 transitions. [2023-12-25 11:47:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 11 states have call successors, (60), 6 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 11 states have call successors, (60) [2023-12-25 11:47:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4684 transitions. [2023-12-25 11:47:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-25 11:47:32,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:47:32,268 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 10, 9, 9, 9, 9, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:47:32,283 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 11:47:32,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-25 11:47:32,471 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:47:32,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:47:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1875437318, now seen corresponding path program 1 times [2023-12-25 11:47:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:47:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916556798] [2023-12-25 11:47:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:47:32,472 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-25 11:47:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:47:32,473 INFO L229 MonitoredProcess]: Starting monitored process 23 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-25 11:47:32,481 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 (23)] Waiting until timeout for monitored process [2023-12-25 11:47:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:47:35,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 11:47:35,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:47:35,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2023-12-25 11:47:35,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:47:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2023-12-25 11:47:36,191 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 11 [2023-12-25 11:47:36,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:47:36,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2023-12-25 11:47:36,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:47:36,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2023-12-25 11:47:37,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:47:37,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2023-12-25 11:47:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 409 proven. 12 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2023-12-25 11:47:37,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:47:39,551 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 20 treesize of output 18 [2023-12-25 11:47:39,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 27 [2023-12-25 11:47:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2023-12-25 11:47:40,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:47:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916556798] [2023-12-25 11:47:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916556798] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 11:47:40,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:47:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 11:47:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655640186] [2023-12-25 11:47:40,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:47:40,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 11:47:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:47:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 11:47:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-25 11:47:40,337 INFO L87 Difference]: Start difference. First operand 3102 states and 4684 transitions. Second operand has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) [2023-12-25 11:47:45,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:49,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:53,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:47:57,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:01,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:05,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:09,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:48:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:48:33,202 INFO L93 Difference]: Finished difference Result 3562 states and 5351 transitions. [2023-12-25 11:48:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 11:48:33,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) Word has length 257 [2023-12-25 11:48:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:48:33,211 INFO L225 Difference]: With dead ends: 3562 [2023-12-25 11:48:33,211 INFO L226 Difference]: Without dead ends: 2781 [2023-12-25 11:48:33,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2023-12-25 11:48:33,214 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 948 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 756 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.3s IncrementalHoareTripleChecker+Time [2023-12-25 11:48:33,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 2051 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 1800 Invalid, 7 Unknown, 0 Unchecked, 51.3s Time] [2023-12-25 11:48:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2023-12-25 11:48:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2777. [2023-12-25 11:48:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 1675 states have (on average 1.2835820895522387) internal successors, (2150), 1742 states have internal predecessors, (2150), 880 states have call successors, (880), 158 states have call predecessors, (880), 221 states have return successors, (1108), 898 states have call predecessors, (1108), 880 states have call successors, (1108) [2023-12-25 11:48:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 4138 transitions. [2023-12-25 11:48:33,678 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 4138 transitions. Word has length 257 [2023-12-25 11:48:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:48:33,679 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 4138 transitions. [2023-12-25 11:48:33,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 13 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 11 states have call predecessors, (61), 13 states have call successors, (61) [2023-12-25 11:48:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 4138 transitions. [2023-12-25 11:48:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-12-25 11:48:33,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:48:33,686 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 10, 7, 7, 7, 7, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:48:33,702 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 (23)] Ended with exit code 0 [2023-12-25 11:48:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-25 11:48:33,895 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:48:33,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:48:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1847553093, now seen corresponding path program 1 times [2023-12-25 11:48:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:48:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973419011] [2023-12-25 11:48:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:48:33,897 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-25 11:48:33,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:48:33,898 INFO L229 MonitoredProcess]: Starting monitored process 24 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-25 11:48:33,900 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 (24)] Waiting until timeout for monitored process [2023-12-25 11:48:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:48:36,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 11:48:36,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:48:36,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-25 11:48:37,034 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-25 11:48:42,371 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 19 treesize of output 14 [2023-12-25 11:48:43,060 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 19 treesize of output 11 [2023-12-25 11:48:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 400 proven. 20 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2023-12-25 11:48:43,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:48:45,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:48:45,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:48:45,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:48:45,297 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 22 treesize of output 14 [2023-12-25 11:48:47,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:48:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973419011] [2023-12-25 11:48:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973419011] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:48:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [61108433] [2023-12-25 11:48:47,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:48:47,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 11:48:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 11:48:47,113 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 11:48:47,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-25 11:48:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:48:52,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 11:48:52,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:48:52,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-12-25 11:48:53,311 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-25 11:48:54,794 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 19 treesize of output 14 [2023-12-25 11:48:56,090 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 19 treesize of output 11 [2023-12-25 11:48:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 400 proven. 20 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2023-12-25 11:48:56,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 11:48:57,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 11:48:57,594 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-25 11:48:57,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 11:48:57,610 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 22 treesize of output 14 [2023-12-25 11:48:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [61108433] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 11:48:58,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 11:48:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2023-12-25 11:48:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948935418] [2023-12-25 11:48:58,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 11:48:58,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 11:48:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:48:58,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 11:48:58,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=566, Unknown=2, NotChecked=0, Total=650 [2023-12-25 11:48:58,564 INFO L87 Difference]: Start difference. First operand 2777 states and 4138 transitions. Second operand has 21 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 13 states have call successors, (37), 6 states have call predecessors, (37), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2023-12-25 11:49:02,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:06,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:11,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:15,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:19,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:23,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:27,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 11:49:31,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:35,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:42,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:51,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:49:52,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:50:07,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 11:50:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:50:19,565 INFO L93 Difference]: Finished difference Result 4517 states and 6859 transitions. [2023-12-25 11:50:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 11:50:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 13 states have call successors, (37), 6 states have call predecessors, (37), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) Word has length 235 [2023-12-25 11:50:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:50:19,573 INFO L225 Difference]: With dead ends: 4517 [2023-12-25 11:50:19,573 INFO L226 Difference]: Without dead ends: 2845 [2023-12-25 11:50:19,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 766 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=247, Invalid=1557, Unknown=2, NotChecked=0, Total=1806 [2023-12-25 11:50:19,578 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 736 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 597 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.8s IncrementalHoareTripleChecker+Time [2023-12-25 11:50:19,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 2210 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 2758 Invalid, 11 Unknown, 0 Unchecked, 77.8s Time] [2023-12-25 11:50:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2023-12-25 11:50:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2779. [2023-12-25 11:50:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 1676 states have (on average 1.2834128878281623) internal successors, (2151), 1744 states have internal predecessors, (2151), 880 states have call successors, (880), 158 states have call predecessors, (880), 222 states have return successors, (1110), 898 states have call predecessors, (1110), 880 states have call successors, (1110) [2023-12-25 11:50:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4141 transitions. [2023-12-25 11:50:20,020 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4141 transitions. Word has length 235 [2023-12-25 11:50:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:50:20,020 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 4141 transitions. [2023-12-25 11:50:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 13 states have call successors, (37), 6 states have call predecessors, (37), 8 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2023-12-25 11:50:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4141 transitions. [2023-12-25 11:50:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-25 11:50:20,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:50:20,027 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 10, 7, 7, 7, 7, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:50:20,046 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 (24)] Forceful destruction successful, exit code 0 [2023-12-25 11:50:20,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-25 11:50:20,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 11:50:20,440 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:50:20,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:50:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -32944175, now seen corresponding path program 1 times [2023-12-25 11:50:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:50:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090029478] [2023-12-25 11:50:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:50:20,442 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-25 11:50:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:50:20,442 INFO L229 MonitoredProcess]: Starting monitored process 26 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-25 11:50:20,443 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 (26)] Waiting until timeout for monitored process [2023-12-25 11:50:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:50:21,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 11:50:21,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:50:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2023-12-25 11:50:21,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:50:21,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:50:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090029478] [2023-12-25 11:50:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090029478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:50:21,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:50:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 11:50:21,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317804655] [2023-12-25 11:50:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:50:21,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 11:50:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:50:21,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 11:50:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:50:21,405 INFO L87 Difference]: Start difference. First operand 2779 states and 4141 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-25 11:50:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:50:22,078 INFO L93 Difference]: Finished difference Result 5201 states and 7930 transitions. [2023-12-25 11:50:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 11:50:22,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 238 [2023-12-25 11:50:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:50:22,085 INFO L225 Difference]: With dead ends: 5201 [2023-12-25 11:50:22,085 INFO L226 Difference]: Without dead ends: 2788 [2023-12-25 11:50:22,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 11:50:22,092 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 11:50:22,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 11:50:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2023-12-25 11:50:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2788. [2023-12-25 11:50:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2788 states, 1685 states have (on average 1.2813056379821959) internal successors, (2159), 1753 states have internal predecessors, (2159), 880 states have call successors, (880), 158 states have call predecessors, (880), 222 states have return successors, (1110), 898 states have call predecessors, (1110), 880 states have call successors, (1110) [2023-12-25 11:50:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 4149 transitions. [2023-12-25 11:50:22,544 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 4149 transitions. Word has length 238 [2023-12-25 11:50:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:50:22,544 INFO L495 AbstractCegarLoop]: Abstraction has 2788 states and 4149 transitions. [2023-12-25 11:50:22,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-25 11:50:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 4149 transitions. [2023-12-25 11:50:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-25 11:50:22,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:50:22,551 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 10, 7, 7, 7, 7, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:50:22,563 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 11:50:22,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-25 11:50:22,752 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:50:22,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:50:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -993613713, now seen corresponding path program 1 times [2023-12-25 11:50:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:50:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834151961] [2023-12-25 11:50:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:50:22,753 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-25 11:50:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:50:22,754 INFO L229 MonitoredProcess]: Starting monitored process 27 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-25 11:50:22,767 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 (27)] Waiting until timeout for monitored process [2023-12-25 11:50:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:50:24,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 11:50:24,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:50:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 6 [2023-12-25 11:50:25,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 3 [2023-12-25 11:50:25,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 11:50:25,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 Received shutdown request... [2023-12-25 11:50:27,171 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:50:27,173 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 (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 11:50:27,192 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 (27)] Ended with exit code 0 [2023-12-25 11:50:27,209 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-25 11:50:27,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-25 11:50:27,372 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 238 with TraceHistMax 21,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. [2023-12-25 11:50:27,376 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:50:27,377 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:50:27,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:50:27 BoogieIcfgContainer [2023-12-25 11:50:27,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:50:27,379 INFO L158 Benchmark]: Toolchain (without parser) took 859842.07ms. Allocated memory was 210.8MB in the beginning and 416.3MB in the end (delta: 205.5MB). Free memory was 152.6MB in the beginning and 123.9MB in the end (delta: 28.7MB). Peak memory consumption was 235.6MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.46ms. Allocated memory is still 210.8MB. Free memory was 152.6MB in the beginning and 160.2MB in the end (delta: -7.6MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 210.8MB. Free memory was 160.2MB in the beginning and 155.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: Boogie Preprocessor took 96.30ms. Allocated memory is still 210.8MB. Free memory was 155.5MB in the beginning and 145.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: RCFGBuilder took 5597.28ms. Allocated memory was 210.8MB in the beginning and 282.1MB in the end (delta: 71.3MB). Free memory was 145.0MB in the beginning and 224.2MB in the end (delta: -79.2MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,379 INFO L158 Benchmark]: TraceAbstraction took 853524.68ms. Allocated memory was 282.1MB in the beginning and 416.3MB in the end (delta: 134.2MB). Free memory was 223.7MB in the beginning and 123.9MB in the end (delta: 99.8MB). Peak memory consumption was 234.6MB. Max. memory is 8.0GB. [2023-12-25 11:50:27,380 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.13ms. Allocated memory is still 210.8MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.46ms. Allocated memory is still 210.8MB. Free memory was 152.6MB in the beginning and 160.2MB in the end (delta: -7.6MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 210.8MB. Free memory was 160.2MB in the beginning and 155.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.30ms. Allocated memory is still 210.8MB. Free memory was 155.5MB in the beginning and 145.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 5597.28ms. Allocated memory was 210.8MB in the beginning and 282.1MB in the end (delta: 71.3MB). Free memory was 145.0MB in the beginning and 224.2MB in the end (delta: -79.2MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. * TraceAbstraction took 853524.68ms. Allocated memory was 282.1MB in the beginning and 416.3MB in the end (delta: 134.2MB). Free memory was 223.7MB in the beginning and 123.9MB in the end (delta: 99.8MB). Peak memory consumption was 234.6MB. 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: 779]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 779). Cancelled while NwaCegarLoop was analyzing trace of length 238 with TraceHistMax 21,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 212 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 853.5s, OverallIterations: 25, TraceHistogramMax: 23, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 736.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 94 mSolverCounterUnknown, 15300 SdHoareTripleChecker+Valid, 702.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14601 mSDsluCounter, 35650 SdHoareTripleChecker+Invalid, 690.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27454 mSDsCounter, 10885 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29693 IncrementalHoareTripleChecker+Invalid, 40672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10885 mSolverCounterUnsat, 8196 mSDtfsCounter, 29693 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7766 GetRequests, 7375 SyntacticMatches, 19 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 50.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3679occurred in iteration=18, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 980 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 21.9s SatisfiabilityAnalysisTime, 70.7s InterpolantComputationTime, 4894 NumberOfCodeBlocks, 4633 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7196 ConstructedInterpolants, 32 QuantifiedInterpolants, 18234 SizeOfPredicates, 75 NumberOfNonLiveVariables, 24715 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 36 InterpolantComputations, 12 PerfectInterpolantSequences, 31629/31933 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