/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/recursified_nla-digbench/recursified_ps2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:03:45,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:03:45,548 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 07:03:45,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:03:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:03:45,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:03:45,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:03:45,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:03:45,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:03:45,582 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:03:45,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:03:45,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:03:45,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:03:45,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:03:45,584 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:03:45,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:03:45,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:03:45,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:03:45,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:03:45,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:03:45,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:03:45,587 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:03:45,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:03:45,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:03:45,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:03:45,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:03:45,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:03:45,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:03:45,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:03:45,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:03:45,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:03:45,590 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:03:45,590 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 07:03:45,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:03:45,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:03:45,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:03:45,807 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:03:45,807 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:03:45,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_nla-digbench/recursified_ps2-ll.c [2023-12-25 07:03:46,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:03:46,987 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:03:46,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_ps2-ll.c [2023-12-25 07:03:46,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c006afef/78120426cdb24981ad1bff79ff18f590/FLAG0c3159ac8 [2023-12-25 07:03:47,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c006afef/78120426cdb24981ad1bff79ff18f590 [2023-12-25 07:03:47,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:03:47,009 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:03:47,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:03:47,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:03:47,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:03:47,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4ab6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47, skipping insertion in model container [2023-12-25 07:03:47,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,034 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:03:47,140 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_ps2-ll.c[983,996] [2023-12-25 07:03:47,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:03:47,173 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:03:47,181 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_nla-digbench/recursified_ps2-ll.c[983,996] [2023-12-25 07:03:47,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:03:47,199 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:03:47,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47 WrapperNode [2023-12-25 07:03:47,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:03:47,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:03:47,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:03:47,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:03:47,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,223 INFO L138 Inliner]: procedures = 20, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2023-12-25 07:03:47,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:03:47,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:03:47,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:03:47,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:03:47,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,257 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 4, 2, 10]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 2, 2, 1, 2]. [2023-12-25 07:03:47,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:03:47,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:03:47,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:03:47,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:03:47,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (1/1) ... [2023-12-25 07:03:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:03:47,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:03:47,306 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 07:03:47,309 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 07:03:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-25 07:03:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:03:47,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-25 07:03:47,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2023-12-25 07:03:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 07:03:47,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-25 07:03:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-25 07:03:47,405 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:03:47,407 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:03:47,625 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:03:47,665 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:03:47,666 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:03:47,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:03:47 BoogieIcfgContainer [2023-12-25 07:03:47,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:03:47,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:03:47,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:03:47,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:03:47,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:03:47" (1/3) ... [2023-12-25 07:03:47,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f33cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:03:47, skipping insertion in model container [2023-12-25 07:03:47,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:03:47" (2/3) ... [2023-12-25 07:03:47,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f33cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:03:47, skipping insertion in model container [2023-12-25 07:03:47,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:03:47" (3/3) ... [2023-12-25 07:03:47,673 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_ps2-ll.c [2023-12-25 07:03:47,685 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:03:47,685 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:03:47,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:03:47,727 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;@3bb5430f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:03:47,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:03:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 07:03:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 07:03:47,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:03:47,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:03:47,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:03:47,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:03:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash -248335761, now seen corresponding path program 1 times [2023-12-25 07:03:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:03:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758741289] [2023-12-25 07:03:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:03:47,757 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 07:03:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:03:47,759 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 07:03:47,798 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 07:03:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:03:47,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 07:03:47,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:03:48,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:03:48,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:03:48,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:03:48,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:03:48,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:03:48,253 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 30 treesize of output 14 [2023-12-25 07:03:48,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:03:48,261 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 43 treesize of output 19 [2023-12-25 07:03:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:03:48,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:03:48,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:03:48,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758741289] [2023-12-25 07:03:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758741289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:03:48,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:03:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 07:03:48,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544607490] [2023-12-25 07:03:48,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:03:48,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:03:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:03:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:03:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:03:48,366 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:03:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:03:49,127 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-12-25 07:03:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:03:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 07:03:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:03:49,135 INFO L225 Difference]: With dead ends: 52 [2023-12-25 07:03:49,135 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 07:03:49,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-25 07:03:49,139 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:03:49,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 72 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:03:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 07:03:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-25 07:03:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-25 07:03:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-25 07:03:49,172 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2023-12-25 07:03:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:03:49,173 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-25 07:03:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:03:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-25 07:03:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 07:03:49,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:03:49,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:03:49,191 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 07:03:49,379 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 07:03:49,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:03:49,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:03:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2110697342, now seen corresponding path program 1 times [2023-12-25 07:03:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:03:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123767582] [2023-12-25 07:03:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:03:49,382 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 07:03:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:03:49,383 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 07:03:49,416 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 07:03:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:03:49,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-25 07:03:49,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:03:49,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:03:49,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:03:49,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:03:49,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:03:50,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:03:50,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 53 [2023-12-25 07:03:50,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2023-12-25 07:03:50,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:03:50,266 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 116 treesize of output 68 [2023-12-25 07:03:50,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:03:50,281 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 74 treesize of output 58 [2023-12-25 07:03:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:03:50,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:04:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:04:24,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:04:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123767582] [2023-12-25 07:04:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123767582] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:04:24,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:04:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-25 07:04:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959559553] [2023-12-25 07:04:24,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:04:24,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:04:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:04:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:04:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=288, Unknown=4, NotChecked=0, Total=342 [2023-12-25 07:04:24,287 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 07:05:01,533 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:05:22,328 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:05:49,308 WARN L293 SmtUtils]: Spent 17.86s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:06:23,241 WARN L293 SmtUtils]: Spent 21.36s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:06:28,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:06:32,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:06:37,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:06:41,941 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 07:07:10,412 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 07:07:14,424 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 07:07:51,671 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 07:07:55,685 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 07:07:59,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:03,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 07:08:07,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:11,933 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 07:08:16,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:20,038 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 07:08:24,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:28,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 07:08:32,537 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 07:08:37,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:08:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:08:38,170 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-12-25 07:08:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 07:08:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 07:08:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:08:38,185 INFO L225 Difference]: With dead ends: 73 [2023-12-25 07:08:38,186 INFO L226 Difference]: Without dead ends: 69 [2023-12-25 07:08:38,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 198.2s TimeCoverageRelationStatistics Valid=177, Invalid=860, Unknown=19, NotChecked=0, Total=1056 [2023-12-25 07:08:38,187 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 31 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:08:38,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 125 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 187 Invalid, 18 Unknown, 0 Unchecked, 87.4s Time] [2023-12-25 07:08:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-25 07:08:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-12-25 07:08:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 07:08:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2023-12-25 07:08:38,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 18 [2023-12-25 07:08:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:08:38,213 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2023-12-25 07:08:38,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 07:08:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2023-12-25 07:08:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 07:08:38,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:08:38,216 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:08:38,224 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 07:08:38,422 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 07:08:38,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:08:38,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:08:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1884088945, now seen corresponding path program 1 times [2023-12-25 07:08:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:08:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440882328] [2023-12-25 07:08:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:08:38,429 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 07:08:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:08:38,430 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 07:08:38,431 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 07:08:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:08:38,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 07:08:38,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:08:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:44,343 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 65 treesize of output 49 [2023-12-25 07:08:44,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:08:44,397 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 83 treesize of output 35 [2023-12-25 07:08:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:08:48,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:09:34,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:09:34,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 148 [2023-12-25 07:09:36,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:09:36,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 88 [2023-12-25 07:12:47,559 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 07:12:59,738 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 07:13:09,031 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 07:15:32,986 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 07:15:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:15:40,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:15:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440882328] [2023-12-25 07:15:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440882328] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:15:40,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:15:40,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2023-12-25 07:15:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277337880] [2023-12-25 07:15:40,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:15:40,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 07:15:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:15:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 07:15:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=260, Unknown=3, NotChecked=0, Total=306 [2023-12-25 07:15:40,478 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 07:15:50,115 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 07:15:54,132 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 07:15:59,178 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 07:16:15,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:16:17,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 07:16:21,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 07:16:26,014 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 07:16:30,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 [1] [2023-12-25 07:16:34,052 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 07:16:38,065 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 [1] [2023-12-25 07:16:42,093 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 07:17:09,600 WARN L293 SmtUtils]: Spent 16.24s on a formula simplification. DAG size of input: 65 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 07:17:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:17:14,281 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-12-25 07:17:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:17:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-12-25 07:17:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:17:14,283 INFO L225 Difference]: With dead ends: 73 [2023-12-25 07:17:14,283 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 07:17:14,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 79.8s TimeCoverageRelationStatistics Valid=91, Invalid=506, Unknown=3, NotChecked=0, Total=600 [2023-12-25 07:17:14,284 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:17:14,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 98 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 55.4s Time] [2023-12-25 07:17:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 07:17:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2023-12-25 07:17:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 07:17:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2023-12-25 07:17:14,295 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2023-12-25 07:17:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:17:14,295 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2023-12-25 07:17:14,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 07:17:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2023-12-25 07:17:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 07:17:14,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:17:14,296 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-12-25 07:17:14,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 07:17:14,496 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 07:17:14,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:17:14,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:17:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1758034885, now seen corresponding path program 2 times [2023-12-25 07:17:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:17:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826203275] [2023-12-25 07:17:14,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:17:14,505 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 07:17:14,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:17:14,507 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 07:17:14,540 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 07:17:15,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:17:15,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:17:15,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 131 conjunts are in the unsatisfiable core [2023-12-25 07:17:15,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:17:15,291 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:17:15,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:17:15,343 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:17:15,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:17:15,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 07:17:15,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-25 07:17:17,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:17,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 53 [2023-12-25 07:17:17,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:17,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 33 [2023-12-25 07:17:17,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2023-12-25 07:17:18,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:18,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 109 treesize of output 85 [2023-12-25 07:17:18,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:18,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 181 treesize of output 125 [2023-12-25 07:17:18,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 69 treesize of output 45 [2023-12-25 07:17:20,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 197 treesize of output 173 [2023-12-25 07:17:20,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 381 treesize of output 325 [2023-12-25 07:17:20,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:20,928 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 53 treesize of output 45 [2023-12-25 07:17:22,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:22,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 469 treesize of output 445 [2023-12-25 07:17:22,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:22,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 973 treesize of output 917 [2023-12-25 07:17:23,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:23,717 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 1158 treesize of output 1142 [2023-12-25 07:17:23,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 07:17:23,731 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 1371 treesize of output 1323 [2023-12-25 07:17:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:17:24,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 07:18:32,134 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 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 07:18:32,135 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 07:18:33,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 07:18:33,342 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 07:18:33,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:18:33,451 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 49 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 07:18:33,454 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-25 07:18:33,455 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:18:33,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 07:18:33,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:18:33 BoogieIcfgContainer [2023-12-25 07:18:33,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:18:33,473 INFO L158 Benchmark]: Toolchain (without parser) took 886464.01ms. Allocated memory was 190.8MB in the beginning and 332.4MB in the end (delta: 141.6MB). Free memory was 131.3MB in the beginning and 199.7MB in the end (delta: -68.4MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,473 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:18:33,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.94ms. Allocated memory is still 190.8MB. Free memory was 130.8MB in the beginning and 119.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.80ms. Allocated memory is still 190.8MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,474 INFO L158 Benchmark]: Boogie Preprocessor took 54.81ms. Allocated memory is still 190.8MB. Free memory was 117.7MB in the beginning and 115.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,474 INFO L158 Benchmark]: RCFGBuilder took 386.86ms. Allocated memory is still 190.8MB. Free memory was 115.1MB in the beginning and 97.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,475 INFO L158 Benchmark]: TraceAbstraction took 885804.75ms. Allocated memory was 190.8MB in the beginning and 332.4MB in the end (delta: 141.6MB). Free memory was 97.2MB in the beginning and 199.7MB in the end (delta: -102.5MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-12-25 07:18:33,476 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 190.8MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.94ms. Allocated memory is still 190.8MB. Free memory was 130.8MB in the beginning and 119.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.80ms. Allocated memory is still 190.8MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.81ms. Allocated memory is still 190.8MB. Free memory was 117.7MB in the beginning and 115.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 386.86ms. Allocated memory is still 190.8MB. Free memory was 115.1MB in the beginning and 97.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 885804.75ms. Allocated memory was 190.8MB in the beginning and 332.4MB in the end (delta: 141.6MB). Free memory was 97.2MB in the beginning and 199.7MB in the end (delta: -102.5MB). Peak memory consumption was 39.8MB. 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: 37]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 37). Cancelled while NwaCegarLoop was analyzing trace of length 49 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.7s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 348.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 143.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 140.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 400 IncrementalHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 39 mSDtfsCounter, 400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 278.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 457.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 75 ConstructedInterpolants, 8 QuantifiedInterpolants, 3355 SizeOfPredicates, 59 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4/14 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