./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:15:26,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:15:26,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:15:26,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:15:26,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:15:26,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:15:26,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:15:26,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:15:26,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:15:26,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:15:26,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:15:26,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:15:26,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:15:26,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:15:26,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:15:26,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:15:26,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:15:26,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:15:26,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:15:26,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:15:26,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:15:26,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:15:26,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:15:26,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:15:26,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:15:26,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:15:26,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:15:26,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:15:26,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:15:26,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:15:26,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:15:26,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:15:26,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:15:26,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:15:26,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:15:26,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:15:26,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:15:26,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:15:26,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:15:26,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:15:26,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:15:26,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:15:26,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-11-19 05:15:26,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:15:26,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:15:26,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:15:26,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:15:26,754 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:15:26,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-11-19 05:15:28,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:15:28,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:15:28,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i [2024-11-19 05:15:28,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851016540/5516e4b1c96c4641952d106553de8985/FLAGda3b62cd1 [2024-11-19 05:15:28,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851016540/5516e4b1c96c4641952d106553de8985 [2024-11-19 05:15:28,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:15:28,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:15:28,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:15:28,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:15:28,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:15:28,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:28" (1/1) ... [2024-11-19 05:15:28,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71713c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:28, skipping insertion in model container [2024-11-19 05:15:28,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:15:28" (1/1) ... [2024-11-19 05:15:28,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:15:29,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i[33519,33532] [2024-11-19 05:15:29,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:15:29,544 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:15:29,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-2.i[33519,33532] [2024-11-19 05:15:29,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:15:29,729 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:15:29,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29 WrapperNode [2024-11-19 05:15:29,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:15:29,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:15:29,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:15:29,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:15:29,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:29,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:29,860 INFO L138 Inliner]: procedures = 176, calls = 376, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1715 [2024-11-19 05:15:29,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:15:29,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:15:29,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:15:29,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:15:29,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:29,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:29,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,023 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-11-19 05:15:30,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:15:30,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:15:30,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:15:30,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:15:30,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (1/1) ... [2024-11-19 05:15:30,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:15:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:15:30,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:15:30,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:15:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:15:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:15:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:15:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:15:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:15:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:15:30,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:15:30,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:15:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:15:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:15:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:15:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:15:30,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:15:30,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:15:30,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:15:32,287 INFO L? ?]: Removed 404 outVars from TransFormulas that were not future-live. [2024-11-19 05:15:32,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:15:32,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:15:32,323 INFO L316 CfgBuilder]: Removed 69 assume(true) statements. [2024-11-19 05:15:32,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:32 BoogieIcfgContainer [2024-11-19 05:15:32,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:15:32,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:15:32,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:15:32,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:15:32,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:15:28" (1/3) ... [2024-11-19 05:15:32,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24393afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:32, skipping insertion in model container [2024-11-19 05:15:32,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:15:29" (2/3) ... [2024-11-19 05:15:32,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24393afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:15:32, skipping insertion in model container [2024-11-19 05:15:32,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:15:32" (3/3) ... [2024-11-19 05:15:32,337 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-2.i [2024-11-19 05:15:32,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:15:32,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 05:15:32,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:15:32,465 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e36238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:15:32,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 05:15:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 439 states, 430 states have (on average 1.613953488372093) internal successors, (694), 431 states have internal predecessors, (694), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 05:15:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 05:15:32,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:32,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:32,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -639633962, now seen corresponding path program 1 times [2024-11-19 05:15:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324883681] [2024-11-19 05:15:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:15:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324883681] [2024-11-19 05:15:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324883681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:32,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:15:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454007692] [2024-11-19 05:15:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:32,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:15:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:15:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:15:32,968 INFO L87 Difference]: Start difference. First operand has 439 states, 430 states have (on average 1.613953488372093) internal successors, (694), 431 states have internal predecessors, (694), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:15:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:33,413 INFO L93 Difference]: Finished difference Result 1198 states and 1933 transitions. [2024-11-19 05:15:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:15:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 05:15:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:33,439 INFO L225 Difference]: With dead ends: 1198 [2024-11-19 05:15:33,439 INFO L226 Difference]: Without dead ends: 720 [2024-11-19 05:15:33,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:15:33,453 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 467 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:33,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1799 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:15:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-19 05:15:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-19 05:15:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4541607898448519) internal successors, (1031), 709 states have internal predecessors, (1031), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1049 transitions. [2024-11-19 05:15:33,562 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1049 transitions. Word has length 10 [2024-11-19 05:15:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:33,563 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1049 transitions. [2024-11-19 05:15:33,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:15:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1049 transitions. [2024-11-19 05:15:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-19 05:15:33,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:33,577 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:33,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:15:33,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash 811678255, now seen corresponding path program 1 times [2024-11-19 05:15:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094274210] [2024-11-19 05:15:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:15:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094274210] [2024-11-19 05:15:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094274210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:15:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089340941] [2024-11-19 05:15:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:15:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:15:34,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:15:34,371 INFO L87 Difference]: Start difference. First operand 720 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:34,486 INFO L93 Difference]: Finished difference Result 1386 states and 2015 transitions. [2024-11-19 05:15:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:15:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-19 05:15:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:34,491 INFO L225 Difference]: With dead ends: 1386 [2024-11-19 05:15:34,491 INFO L226 Difference]: Without dead ends: 726 [2024-11-19 05:15:34,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:15:34,496 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 105 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:34,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1551 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:15:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-19 05:15:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 720. [2024-11-19 05:15:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4344146685472496) internal successors, (1017), 709 states have internal predecessors, (1017), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1035 transitions. [2024-11-19 05:15:34,534 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1035 transitions. Word has length 171 [2024-11-19 05:15:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:34,534 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1035 transitions. [2024-11-19 05:15:34,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1035 transitions. [2024-11-19 05:15:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-19 05:15:34,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:34,541 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:34,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:15:34,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2074298589, now seen corresponding path program 1 times [2024-11-19 05:15:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425516622] [2024-11-19 05:15:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:15:34,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:34,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425516622] [2024-11-19 05:15:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425516622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:15:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275804610] [2024-11-19 05:15:34,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:15:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:15:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:15:34,895 INFO L87 Difference]: Start difference. First operand 720 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:34,956 INFO L93 Difference]: Finished difference Result 1376 states and 1982 transitions. [2024-11-19 05:15:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:15:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-19 05:15:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:34,962 INFO L225 Difference]: With dead ends: 1376 [2024-11-19 05:15:34,963 INFO L226 Difference]: Without dead ends: 732 [2024-11-19 05:15:34,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:15:34,967 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:34,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:15:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-19 05:15:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2024-11-19 05:15:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 721 states have (on average 1.4271844660194175) internal successors, (1029), 721 states have internal predecessors, (1029), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1047 transitions. [2024-11-19 05:15:34,994 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1047 transitions. Word has length 171 [2024-11-19 05:15:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:34,996 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1047 transitions. [2024-11-19 05:15:34,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1047 transitions. [2024-11-19 05:15:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-19 05:15:34,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:35,001 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:35,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:15:35,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:35,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1533869083, now seen corresponding path program 1 times [2024-11-19 05:15:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:35,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517547353] [2024-11-19 05:15:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:15:35,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517547353] [2024-11-19 05:15:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517547353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:35,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:15:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664172291] [2024-11-19 05:15:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:15:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:15:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:15:35,286 INFO L87 Difference]: Start difference. First operand 732 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:35,340 INFO L93 Difference]: Finished difference Result 1314 states and 1882 transitions. [2024-11-19 05:15:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:15:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-19 05:15:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:35,347 INFO L225 Difference]: With dead ends: 1314 [2024-11-19 05:15:35,348 INFO L226 Difference]: Without dead ends: 730 [2024-11-19 05:15:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:15:35,352 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 134 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:35,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1128 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:15:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-19 05:15:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2024-11-19 05:15:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 719 states have (on average 1.426981919332406) internal successors, (1026), 719 states have internal predecessors, (1026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1044 transitions. [2024-11-19 05:15:35,378 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1044 transitions. Word has length 171 [2024-11-19 05:15:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:35,379 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1044 transitions. [2024-11-19 05:15:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:15:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1044 transitions. [2024-11-19 05:15:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 05:15:35,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:35,382 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:35,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:15:35,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2121725111, now seen corresponding path program 1 times [2024-11-19 05:15:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971230629] [2024-11-19 05:15:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:35,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971230629] [2024-11-19 05:15:35,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971230629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:35,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:35,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:15:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309320802] [2024-11-19 05:15:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:35,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:15:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:15:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:15:35,849 INFO L87 Difference]: Start difference. First operand 730 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 05:15:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:35,930 INFO L93 Difference]: Finished difference Result 1173 states and 1674 transitions. [2024-11-19 05:15:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:15:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2024-11-19 05:15:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:35,935 INFO L225 Difference]: With dead ends: 1173 [2024-11-19 05:15:35,935 INFO L226 Difference]: Without dead ends: 646 [2024-11-19 05:15:35,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:15:35,937 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 30 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:35,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1382 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:15:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-19 05:15:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2024-11-19 05:15:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 635 states have (on average 1.373228346456693) internal successors, (872), 635 states have internal predecessors, (872), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 890 transitions. [2024-11-19 05:15:35,956 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 890 transitions. Word has length 186 [2024-11-19 05:15:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:35,958 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 890 transitions. [2024-11-19 05:15:35,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 05:15:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 890 transitions. [2024-11-19 05:15:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 05:15:35,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:35,960 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:35,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:15:35,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -61607613, now seen corresponding path program 1 times [2024-11-19 05:15:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867569030] [2024-11-19 05:15:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 05:15:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867569030] [2024-11-19 05:15:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867569030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:15:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864564883] [2024-11-19 05:15:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:15:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:15:37,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:15:37,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:15:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:38,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 05:15:38,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:15:38,070 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 22 treesize of output 7 [2024-11-19 05:15:38,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 05:15:38,613 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 54 treesize of output 38 [2024-11-19 05:15:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:39,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:15:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864564883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:15:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 05:15:39,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595126072] [2024-11-19 05:15:39,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:39,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:15:39,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:39,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:15:39,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-19 05:15:39,041 INFO L87 Difference]: Start difference. First operand 646 states and 890 transitions. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:41,566 INFO L93 Difference]: Finished difference Result 1303 states and 1784 transitions. [2024-11-19 05:15:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:15:41,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2024-11-19 05:15:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:41,571 INFO L225 Difference]: With dead ends: 1303 [2024-11-19 05:15:41,571 INFO L226 Difference]: Without dead ends: 749 [2024-11-19 05:15:41,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-19 05:15:41,575 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 729 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:41,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 2359 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 656 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 05:15:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-19 05:15:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 678. [2024-11-19 05:15:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 667 states have (on average 1.3628185907046477) internal successors, (909), 667 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 927 transitions. [2024-11-19 05:15:41,602 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 927 transitions. Word has length 186 [2024-11-19 05:15:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 927 transitions. [2024-11-19 05:15:41,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 927 transitions. [2024-11-19 05:15:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 05:15:41,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:41,605 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:41,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 05:15:41,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 05:15:41,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1342261573, now seen corresponding path program 1 times [2024-11-19 05:15:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768212254] [2024-11-19 05:15:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768212254] [2024-11-19 05:15:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768212254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:15:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869727588] [2024-11-19 05:15:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:42,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:15:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:15:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:15:42,109 INFO L87 Difference]: Start difference. First operand 678 states and 927 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:42,168 INFO L93 Difference]: Finished difference Result 1184 states and 1614 transitions. [2024-11-19 05:15:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:15:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2024-11-19 05:15:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:42,172 INFO L225 Difference]: With dead ends: 1184 [2024-11-19 05:15:42,172 INFO L226 Difference]: Without dead ends: 538 [2024-11-19 05:15:42,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:15:42,174 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 9 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:42,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:15:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-19 05:15:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-19 05:15:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 527 states have (on average 1.3263757115749526) internal successors, (699), 527 states have internal predecessors, (699), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 717 transitions. [2024-11-19 05:15:42,194 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 717 transitions. Word has length 186 [2024-11-19 05:15:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:42,194 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 717 transitions. [2024-11-19 05:15:42,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 717 transitions. [2024-11-19 05:15:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 05:15:42,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:42,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:42,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:15:42,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1781361707, now seen corresponding path program 1 times [2024-11-19 05:15:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190542266] [2024-11-19 05:15:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 05:15:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190542266] [2024-11-19 05:15:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190542266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:15:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365020657] [2024-11-19 05:15:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:43,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:15:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:15:43,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:15:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:15:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:43,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 05:15:43,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:15:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:43,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:15:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365020657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:15:43,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 05:15:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79393164] [2024-11-19 05:15:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:43,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:15:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:15:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:43,803 INFO L87 Difference]: Start difference. First operand 538 states and 717 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:43,919 INFO L93 Difference]: Finished difference Result 1038 states and 1394 transitions. [2024-11-19 05:15:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:15:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2024-11-19 05:15:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:43,926 INFO L225 Difference]: With dead ends: 1038 [2024-11-19 05:15:43,926 INFO L226 Difference]: Without dead ends: 538 [2024-11-19 05:15:43,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:43,929 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 13 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:43,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1063 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:15:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-19 05:15:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-19 05:15:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 527 states have (on average 1.3225806451612903) internal successors, (697), 527 states have internal predecessors, (697), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 715 transitions. [2024-11-19 05:15:43,949 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 715 transitions. Word has length 187 [2024-11-19 05:15:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:43,949 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 715 transitions. [2024-11-19 05:15:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 715 transitions. [2024-11-19 05:15:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-19 05:15:43,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:43,951 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:43,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:15:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 05:15:44,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:44,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -775264098, now seen corresponding path program 1 times [2024-11-19 05:15:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324014878] [2024-11-19 05:15:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:44,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:44,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324014878] [2024-11-19 05:15:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324014878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:44,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 05:15:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689862573] [2024-11-19 05:15:44,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:44,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:15:44,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:15:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:44,738 INFO L87 Difference]: Start difference. First operand 538 states and 715 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:44,966 INFO L93 Difference]: Finished difference Result 1041 states and 1396 transitions. [2024-11-19 05:15:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:15:44,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-19 05:15:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:44,969 INFO L225 Difference]: With dead ends: 1041 [2024-11-19 05:15:44,970 INFO L226 Difference]: Without dead ends: 544 [2024-11-19 05:15:44,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:44,972 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 4 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:44,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1379 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:15:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-19 05:15:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2024-11-19 05:15:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 533 states have (on average 1.3189493433395871) internal successors, (703), 533 states have internal predecessors, (703), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 721 transitions. [2024-11-19 05:15:44,994 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 721 transitions. Word has length 188 [2024-11-19 05:15:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:44,995 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 721 transitions. [2024-11-19 05:15:44,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 721 transitions. [2024-11-19 05:15:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 05:15:44,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:44,998 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:44,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:15:44,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1714143676, now seen corresponding path program 1 times [2024-11-19 05:15:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632150069] [2024-11-19 05:15:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 05:15:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632150069] [2024-11-19 05:15:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632150069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:15:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:15:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137350237] [2024-11-19 05:15:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:45,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:15:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:15:45,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:15:45,495 INFO L87 Difference]: Start difference. First operand 544 states and 721 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:45,846 INFO L93 Difference]: Finished difference Result 1047 states and 1400 transitions. [2024-11-19 05:15:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:15:45,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-19 05:15:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:45,850 INFO L225 Difference]: With dead ends: 1047 [2024-11-19 05:15:45,850 INFO L226 Difference]: Without dead ends: 554 [2024-11-19 05:15:45,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:15:45,853 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 8 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1994 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:15:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-19 05:15:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2024-11-19 05:15:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 541 states have (on average 1.3179297597042514) internal successors, (713), 541 states have internal predecessors, (713), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 05:15:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 731 transitions. [2024-11-19 05:15:45,874 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 731 transitions. Word has length 189 [2024-11-19 05:15:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 731 transitions. [2024-11-19 05:15:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 05:15:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 731 transitions. [2024-11-19 05:15:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 05:15:45,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:45,877 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:45,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:15:45,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 120248104, now seen corresponding path program 1 times [2024-11-19 05:15:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184663485] [2024-11-19 05:15:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 05:15:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184663485] [2024-11-19 05:15:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184663485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:15:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810416819] [2024-11-19 05:15:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:15:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:15:46,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:15:46,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:15:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:47,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 05:15:47,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:15:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:15:47,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:15:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810416819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:15:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:15:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2024-11-19 05:15:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742517231] [2024-11-19 05:15:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:15:47,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:15:47,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:15:47,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:15:47,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:47,421 INFO L87 Difference]: Start difference. First operand 552 states and 731 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 05:15:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:15:47,505 INFO L93 Difference]: Finished difference Result 1074 states and 1437 transitions. [2024-11-19 05:15:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:15:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2024-11-19 05:15:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:15:47,510 INFO L225 Difference]: With dead ends: 1074 [2024-11-19 05:15:47,510 INFO L226 Difference]: Without dead ends: 617 [2024-11-19 05:15:47,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:15:47,512 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 367 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:15:47,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1582 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:15:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-19 05:15:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 555. [2024-11-19 05:15:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 543 states have (on average 1.3186003683241252) internal successors, (716), 544 states have internal predecessors, (716), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 05:15:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 737 transitions. [2024-11-19 05:15:47,532 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 737 transitions. Word has length 189 [2024-11-19 05:15:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:15:47,533 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 737 transitions. [2024-11-19 05:15:47,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 05:15:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 737 transitions. [2024-11-19 05:15:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-19 05:15:47,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:15:47,535 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:15:47,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 05:15:47,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:15:47,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:15:47,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:15:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash -986473756, now seen corresponding path program 1 times [2024-11-19 05:15:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:15:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460555079] [2024-11-19 05:15:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:15:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 05:15:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:15:58,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460555079] [2024-11-19 05:15:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460555079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:15:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95192811] [2024-11-19 05:15:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:15:58,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:15:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:15:58,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:15:58,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 05:15:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:15:59,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 174 conjuncts are in the unsatisfiable core [2024-11-19 05:15:59,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:15:59,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 05:15:59,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 05:16:00,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2024-11-19 05:16:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 05:16:00,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 05:16:00,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:16:00,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 05:16:00,132 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 11 treesize of output 7 [2024-11-19 05:16:00,158 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-19 05:16:00,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-19 05:16:00,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2024-11-19 05:16:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:16:00,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 05:16:00,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 50 [2024-11-19 05:16:00,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-19 05:16:00,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22