./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 16:29:34,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:29:34,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:29:34,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:29:34,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:29:34,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:29:34,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:29:34,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:29:34,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:29:34,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:29:34,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:29:34,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:29:34,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:29:34,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:29:34,969 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:29:34,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:29:34,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:29:34,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:29:34,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:29:34,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:29:34,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:29:34,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:29:34,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:29:34,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:29:34,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:29:34,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:29:34,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:29:34,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:29:34,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:29:34,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:29:34,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:29:34,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:29:34,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:34,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:29:34,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:29:34,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:29:34,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:29:34,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:29:34,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:29:34,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:29:34,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:29:34,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:29:34,981 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-clean/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-clean/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-10-11 16:29:35,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:29:35,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:29:35,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:29:35,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:29:35,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:29:35,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i [2024-10-11 16:29:36,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:29:37,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:29:37,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i [2024-10-11 16:29:37,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eeee7677f/d824049b34a940ab82af636f7ddd1d3b/FLAG873fb4dab [2024-10-11 16:29:37,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eeee7677f/d824049b34a940ab82af636f7ddd1d3b [2024-10-11 16:29:37,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:29:37,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:29:37,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:37,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:29:37,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:29:37,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:37,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c30602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37, skipping insertion in model container [2024-10-11 16:29:37,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:37,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:29:37,557 WARN L248 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_JEN_nondet_test4-2.i[33519,33532] [2024-10-11 16:29:37,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:37,741 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:29:37,782 WARN L248 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_JEN_nondet_test4-2.i[33519,33532] [2024-10-11 16:29:37,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:37,949 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:29:37,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37 WrapperNode [2024-10-11 16:29:37,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:37,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:37,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:29:37,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:29:37,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:37,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,065 INFO L138 Inliner]: procedures = 176, calls = 376, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1715 [2024-10-11 16:29:38,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:38,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:29:38,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:29:38,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:29:38,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,190 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-10-11 16:29:38,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:29:38,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:29:38,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:29:38,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:29:38,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (1/1) ... [2024-10-11 16:29:38,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:38,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:38,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:29:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:29:38,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:29:38,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:29:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:29:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:29:38,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:38,346 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:38,346 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:29:38,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:29:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:29:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:29:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:29:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:29:38,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:29:38,561 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:29:38,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:29:40,119 INFO L? ?]: Removed 404 outVars from TransFormulas that were not future-live. [2024-10-11 16:29:40,119 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:29:40,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:29:40,168 INFO L314 CfgBuilder]: Removed 69 assume(true) statements. [2024-10-11 16:29:40,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:40 BoogieIcfgContainer [2024-10-11 16:29:40,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:29:40,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:29:40,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:29:40,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:29:40,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:29:37" (1/3) ... [2024-10-11 16:29:40,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:40, skipping insertion in model container [2024-10-11 16:29:40,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:37" (2/3) ... [2024-10-11 16:29:40,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239096f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:40, skipping insertion in model container [2024-10-11 16:29:40,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:40" (3/3) ... [2024-10-11 16:29:40,181 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-2.i [2024-10-11 16:29:40,197 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:29:40,197 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:29:40,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:29:40,286 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;@4da9b1c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:29:40,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:29:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 425 states have (on average 1.6211764705882352) internal successors, (689), 426 states have internal predecessors, (689), 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-10-11 16:29:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:29:40,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:40,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:40,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1617784000, now seen corresponding path program 1 times [2024-10-11 16:29:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033738342] [2024-10-11 16:29:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033738342] [2024-10-11 16:29:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033738342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:29:40,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161810147] [2024-10-11 16:29:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:40,609 INFO L87 Difference]: Start difference. First operand has 434 states, 425 states have (on average 1.6211764705882352) internal successors, (689), 426 states have internal predecessors, (689), 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.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 16:29:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:41,075 INFO L93 Difference]: Finished difference Result 1189 states and 1924 transitions. [2024-10-11 16:29:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 16:29:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:41,097 INFO L225 Difference]: With dead ends: 1189 [2024-10-11 16:29:41,097 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 16:29:41,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-11 16:29:41,106 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 467 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:41,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1776 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 16:29:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-11 16:29:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4560906515580736) internal successors, (1028), 706 states have internal predecessors, (1028), 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-10-11 16:29:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1046 transitions. [2024-10-11 16:29:41,192 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1046 transitions. Word has length 9 [2024-10-11 16:29:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:41,192 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1046 transitions. [2024-10-11 16:29:41,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 16:29:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1046 transitions. [2024-10-11 16:29:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:41,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:41,205 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:29:41,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:29:41,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 189676693, now seen corresponding path program 1 times [2024-10-11 16:29:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391732715] [2024-10-11 16:29:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:41,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:41,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391732715] [2024-10-11 16:29:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391732715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:41,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:29:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839663413] [2024-10-11 16:29:41,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:29:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:29:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:41,908 INFO L87 Difference]: Start difference. First operand 717 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 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-10-11 16:29:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:42,362 INFO L93 Difference]: Finished difference Result 1383 states and 2021 transitions. [2024-10-11 16:29:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:29:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 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 168 [2024-10-11 16:29:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:42,369 INFO L225 Difference]: With dead ends: 1383 [2024-10-11 16:29:42,370 INFO L226 Difference]: Without dead ends: 725 [2024-10-11 16:29:42,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:42,376 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 107 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:42,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1975 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-11 16:29:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 717. [2024-10-11 16:29:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4362606232294617) internal successors, (1014), 706 states have internal predecessors, (1014), 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-10-11 16:29:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1032 transitions. [2024-10-11 16:29:42,421 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1032 transitions. Word has length 168 [2024-10-11 16:29:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:42,422 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1032 transitions. [2024-10-11 16:29:42,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 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-10-11 16:29:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1032 transitions. [2024-10-11 16:29:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:42,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:42,429 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:29:42,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:29:42,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1641257335, now seen corresponding path program 1 times [2024-10-11 16:29:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674077299] [2024-10-11 16:29:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674077299] [2024-10-11 16:29:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674077299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205867391] [2024-10-11 16:29:42,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:42,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:42,813 INFO L87 Difference]: Start difference. First operand 717 states and 1032 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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-10-11 16:29:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:43,149 INFO L93 Difference]: Finished difference Result 1373 states and 1988 transitions. [2024-10-11 16:29:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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 168 [2024-10-11 16:29:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:43,153 INFO L225 Difference]: With dead ends: 1373 [2024-10-11 16:29:43,154 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 16:29:43,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-11 16:29:43,156 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 3 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:43,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1551 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 16:29:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-10-11 16:29:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 718 states have (on average 1.4289693593314763) internal successors, (1026), 718 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-10-11 16:29:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1044 transitions. [2024-10-11 16:29:43,181 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1044 transitions. Word has length 168 [2024-10-11 16:29:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:43,183 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1044 transitions. [2024-10-11 16:29:43,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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-10-11 16:29:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1044 transitions. [2024-10-11 16:29:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:43,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:43,186 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:29:43,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:29:43,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2051867701, now seen corresponding path program 1 times [2024-10-11 16:29:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144695396] [2024-10-11 16:29:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:29:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:29:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144695396] [2024-10-11 16:29:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144695396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:43,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:43,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140619440] [2024-10-11 16:29:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:43,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:43,464 INFO L87 Difference]: Start difference. First operand 729 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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-10-11 16:29:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:43,795 INFO L93 Difference]: Finished difference Result 1311 states and 1888 transitions. [2024-10-11 16:29:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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 168 [2024-10-11 16:29:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:43,801 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 16:29:43,801 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 16:29:43,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 16:29:43,805 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 136 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:43,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1578 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 16:29:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2024-10-11 16:29:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 716 states have (on average 1.4287709497206704) internal successors, (1023), 716 states have internal predecessors, (1023), 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-10-11 16:29:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1041 transitions. [2024-10-11 16:29:43,831 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1041 transitions. Word has length 168 [2024-10-11 16:29:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:43,832 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1041 transitions. [2024-10-11 16:29:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 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-10-11 16:29:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1041 transitions. [2024-10-11 16:29:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:29:43,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:43,835 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:29:43,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:29:43,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 72781633, now seen corresponding path program 1 times [2024-10-11 16:29:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:43,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721539670] [2024-10-11 16:29:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:29:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:44,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:29:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:29:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:29:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:29:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721539670] [2024-10-11 16:29:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721539670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:29:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990748324] [2024-10-11 16:29:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:29:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:44,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:29:44,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:44,255 INFO L87 Difference]: Start difference. First operand 727 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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-10-11 16:29:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:44,622 INFO L93 Difference]: Finished difference Result 1170 states and 1680 transitions. [2024-10-11 16:29:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:29:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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 181 [2024-10-11 16:29:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:44,628 INFO L225 Difference]: With dead ends: 1170 [2024-10-11 16:29:44,628 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 16:29:44,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:44,631 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 32 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:44,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1732 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 16:29:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2024-10-11 16:29:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 632 states have (on average 1.375) internal successors, (869), 632 states have internal predecessors, (869), 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-10-11 16:29:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2024-10-11 16:29:44,652 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 181 [2024-10-11 16:29:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2024-10-11 16:29:44,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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-10-11 16:29:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2024-10-11 16:29:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:29:44,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:44,658 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:29:44,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:29:44,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:44,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash -903790899, now seen corresponding path program 1 times [2024-10-11 16:29:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:44,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251949553] [2024-10-11 16:29:44,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:29:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:45,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:29:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:29:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:29:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:29:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:45,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251949553] [2024-10-11 16:29:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251949553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:45,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107545522] [2024-10-11 16:29:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:45,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:29:45,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:29:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:46,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 16:29:46,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:46,421 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-10-11 16:29:51,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:29:51,262 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-10-11 16:29:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:29:51,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107545522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:51,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:29:51,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070979869] [2024-10-11 16:29:51,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:51,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:29:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:29:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=149, Unknown=1, NotChecked=0, Total=182 [2024-10-11 16:29:51,626 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 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-10-11 16:29:59,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:04,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:08,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:12,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:16,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:27,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:32,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 16:30:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:34,970 INFO L93 Difference]: Finished difference Result 1298 states and 1779 transitions. [2024-10-11 16:30:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:30:34,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 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 181 [2024-10-11 16:30:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:34,974 INFO L225 Difference]: With dead ends: 1298 [2024-10-11 16:30:34,974 INFO L226 Difference]: Without dead ends: 746 [2024-10-11 16:30:34,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=92, Invalid=367, Unknown=3, NotChecked=0, Total=462 [2024-10-11 16:30:34,976 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 723 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 7 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:34,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2785 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1147 Invalid, 8 Unknown, 0 Unchecked, 34.6s Time] [2024-10-11 16:30:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-11 16:30:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 675. [2024-10-11 16:30:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 664 states have (on average 1.3644578313253013) internal successors, (906), 664 states have internal predecessors, (906), 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-10-11 16:30:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 924 transitions. [2024-10-11 16:30:34,996 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 924 transitions. Word has length 181 [2024-10-11 16:30:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:34,996 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 924 transitions. [2024-10-11 16:30:34,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 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-10-11 16:30:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 924 transitions. [2024-10-11 16:30:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:30:34,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:34,999 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 16:30:35,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:30:35,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:35,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:35,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash -558962737, now seen corresponding path program 1 times [2024-10-11 16:30:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155651950] [2024-10-11 16:30:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:30:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:30:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:30:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:30:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155651950] [2024-10-11 16:30:35,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155651950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:35,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:30:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975664954] [2024-10-11 16:30:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:35,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:35,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:35,533 INFO L87 Difference]: Start difference. First operand 675 states and 924 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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-10-11 16:30:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:36,223 INFO L93 Difference]: Finished difference Result 1181 states and 1620 transitions. [2024-10-11 16:30:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:30:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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 181 [2024-10-11 16:30:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:36,227 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 16:30:36,227 INFO L226 Difference]: Without dead ends: 537 [2024-10-11 16:30:36,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:30:36,228 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 11 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:36,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1429 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:30:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-11 16:30:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2024-10-11 16:30:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3282442748091603) internal successors, (696), 524 states have internal predecessors, (696), 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-10-11 16:30:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 714 transitions. [2024-10-11 16:30:36,244 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 714 transitions. Word has length 181 [2024-10-11 16:30:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 714 transitions. [2024-10-11 16:30:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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-10-11 16:30:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 714 transitions. [2024-10-11 16:30:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 16:30:36,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:36,246 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 16:30:36,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:30:36,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:36,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1380635871, now seen corresponding path program 1 times [2024-10-11 16:30:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:36,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639003760] [2024-10-11 16:30:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:36,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:30:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:37,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639003760] [2024-10-11 16:30:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639003760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:37,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031987807] [2024-10-11 16:30:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:37,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:37,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:37,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:30:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 16:30:37,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:37,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031987807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:30:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816013017] [2024-10-11 16:30:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:37,976 INFO L87 Difference]: Start difference. First operand 535 states and 714 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-10-11 16:30:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:38,241 INFO L93 Difference]: Finished difference Result 1033 states and 1389 transitions. [2024-10-11 16:30:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 182 [2024-10-11 16:30:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:38,244 INFO L225 Difference]: With dead ends: 1033 [2024-10-11 16:30:38,245 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 16:30:38,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:38,246 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 13 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:38,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1047 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:30:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 16:30:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-10-11 16:30:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3244274809160306) internal successors, (694), 524 states have internal predecessors, (694), 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-10-11 16:30:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 712 transitions. [2024-10-11 16:30:38,260 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 712 transitions. Word has length 182 [2024-10-11 16:30:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:38,261 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 712 transitions. [2024-10-11 16:30:38,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-10-11 16:30:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 712 transitions. [2024-10-11 16:30:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 16:30:38,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:38,263 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 16:30:38,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:38,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:38,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 355420456, now seen corresponding path program 1 times [2024-10-11 16:30:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172223756] [2024-10-11 16:30:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:30:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:39,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:30:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 16:30:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:39,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 16:30:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172223756] [2024-10-11 16:30:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172223756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:30:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841287335] [2024-10-11 16:30:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:30:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:30:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:39,050 INFO L87 Difference]: Start difference. First operand 535 states and 712 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 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-10-11 16:30:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:40,182 INFO L93 Difference]: Finished difference Result 1038 states and 1402 transitions. [2024-10-11 16:30:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:30:40,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 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 183 [2024-10-11 16:30:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:40,185 INFO L225 Difference]: With dead ends: 1038 [2024-10-11 16:30:40,185 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:30:40,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:40,187 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 6 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:40,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1950 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 16:30:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:30:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:30:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 530 states have (on average 1.320754716981132) internal successors, (700), 530 states have internal predecessors, (700), 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-10-11 16:30:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 718 transitions. [2024-10-11 16:30:40,203 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 718 transitions. Word has length 183 [2024-10-11 16:30:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 718 transitions. [2024-10-11 16:30:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 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-10-11 16:30:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 718 transitions. [2024-10-11 16:30:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:30:40,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:40,206 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 16:30:40,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:30:40,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:40,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1189022662, now seen corresponding path program 1 times [2024-10-11 16:30:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:40,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183697602] [2024-10-11 16:30:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:30:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183697602] [2024-10-11 16:30:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183697602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:40,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:30:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301142359] [2024-10-11 16:30:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:40,780 INFO L87 Difference]: Start difference. First operand 541 states and 718 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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-10-11 16:30:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:42,085 INFO L93 Difference]: Finished difference Result 1044 states and 1406 transitions. [2024-10-11 16:30:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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 184 [2024-10-11 16:30:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:42,089 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 16:30:42,089 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 16:30:42,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:30:42,091 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 10 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:42,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2245 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 16:30:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 16:30:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2024-10-11 16:30:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 538 states have (on average 1.3197026022304832) internal successors, (710), 538 states have internal predecessors, (710), 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-10-11 16:30:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 728 transitions. [2024-10-11 16:30:42,109 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 728 transitions. Word has length 184 [2024-10-11 16:30:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 728 transitions. [2024-10-11 16:30:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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-10-11 16:30:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 728 transitions. [2024-10-11 16:30:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:30:42,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:42,112 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 16:30:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:30:42,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2058379490, now seen corresponding path program 1 times [2024-10-11 16:30:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854695906] [2024-10-11 16:30:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:42,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:30:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:30:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:30:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:30:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854695906] [2024-10-11 16:30:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854695906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50678139] [2024-10-11 16:30:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:43,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:43,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:30:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:43,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 16:30:43,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 16:30:43,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50678139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 16:30:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533282526] [2024-10-11 16:30:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:43,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:43,726 INFO L87 Difference]: Start difference. First operand 549 states and 728 transitions. Second operand has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:43,873 INFO L93 Difference]: Finished difference Result 1068 states and 1431 transitions. [2024-10-11 16:30:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:30:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2024-10-11 16:30:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:43,877 INFO L225 Difference]: With dead ends: 1068 [2024-10-11 16:30:43,877 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 16:30:43,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:43,878 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 367 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:43,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 16:30:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 551. [2024-10-11 16:30:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 539 states have (on average 1.320964749536178) internal successors, (712), 540 states have internal predecessors, (712), 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-10-11 16:30:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 733 transitions. [2024-10-11 16:30:43,898 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 733 transitions. Word has length 184 [2024-10-11 16:30:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 733 transitions. [2024-10-11 16:30:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2024-10-11 16:30:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 16:30:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:43,901 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-10-11 16:30:43,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:44,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:44,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1533823042, now seen corresponding path program 1 times [2024-10-11 16:30:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661473958] [2024-10-11 16:30:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:30:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:30:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:30:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 16:30:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661473958] [2024-10-11 16:30:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661473958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809377034] [2024-10-11 16:30:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:45,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:45,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:30:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:45,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:30:45,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:46,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809377034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 16:30:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085073606] [2024-10-11 16:30:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:30:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:30:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:46,323 INFO L87 Difference]: Start difference. First operand 551 states and 733 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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-10-11 16:30:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:47,031 INFO L93 Difference]: Finished difference Result 1058 states and 1420 transitions. [2024-10-11 16:30:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:30:47,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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-10-11 16:30:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:47,034 INFO L225 Difference]: With dead ends: 1058 [2024-10-11 16:30:47,034 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 16:30:47,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:47,035 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 8 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:47,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1970 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:30:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 16:30:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 551. [2024-10-11 16:30:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 539 states have (on average 1.320964749536178) internal successors, (712), 540 states have internal predecessors, (712), 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-10-11 16:30:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 733 transitions. [2024-10-11 16:30:47,051 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 733 transitions. Word has length 188 [2024-10-11 16:30:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:47,051 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 733 transitions. [2024-10-11 16:30:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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-10-11 16:30:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2024-10-11 16:30:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 16:30:47,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:47,054 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-10-11 16:30:47,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:47,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 16:30:47,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -166960612, now seen corresponding path program 1 times [2024-10-11 16:30:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289343232] [2024-10-11 16:30:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:30:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:30:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:30:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 16:30:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:47,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289343232] [2024-10-11 16:30:47,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289343232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:47,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:47,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:30:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275076885] [2024-10-11 16:30:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:47,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:30:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:47,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:30:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:30:47,960 INFO L87 Difference]: Start difference. First operand 551 states and 733 transitions. Second operand has 10 states, 10 states have (on average 17.2) internal successors, (172), 9 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-10-11 16:30:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:48,957 INFO L93 Difference]: Finished difference Result 1063 states and 1424 transitions. [2024-10-11 16:30:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:30:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 9 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-10-11 16:30:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:48,960 INFO L225 Difference]: With dead ends: 1063 [2024-10-11 16:30:48,960 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 16:30:48,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:30:48,963 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 18 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:48,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2641 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 16:30:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 16:30:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 565. [2024-10-11 16:30:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 553 states have (on average 1.3200723327305606) internal successors, (730), 554 states have internal predecessors, (730), 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-10-11 16:30:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 751 transitions. [2024-10-11 16:30:48,980 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 751 transitions. Word has length 189 [2024-10-11 16:30:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:48,980 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 751 transitions. [2024-10-11 16:30:48,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 9 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-10-11 16:30:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 751 transitions. [2024-10-11 16:30:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 16:30:48,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:48,984 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-10-11 16:30:48,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:30:48,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:48,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash 864609720, now seen corresponding path program 1 times [2024-10-11 16:30:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:48,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680980286] [2024-10-11 16:30:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:48,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:30:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:30:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:30:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:50,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 16:30:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:30:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680980286] [2024-10-11 16:30:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680980286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207159462] [2024-10-11 16:30:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:50,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:50,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:50,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:30:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:51,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 16:30:51,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:51,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:30:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207159462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:51,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:30:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2024-10-11 16:30:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688850794] [2024-10-11 16:30:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:30:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:30:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:30:51,565 INFO L87 Difference]: Start difference. First operand 565 states and 751 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 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-10-11 16:30:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:52,497 INFO L93 Difference]: Finished difference Result 1084 states and 1451 transitions. [2024-10-11 16:30:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:30:52,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 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-10-11 16:30:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:52,500 INFO L225 Difference]: With dead ends: 1084 [2024-10-11 16:30:52,500 INFO L226 Difference]: Without dead ends: 585 [2024-10-11 16:30:52,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:30:52,502 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 13 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:52,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2314 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 16:30:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-11 16:30:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2024-10-11 16:30:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 563 states have (on average 1.3179396092362345) internal successors, (742), 564 states have internal predecessors, (742), 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-10-11 16:30:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 763 transitions. [2024-10-11 16:30:52,539 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 763 transitions. Word has length 189 [2024-10-11 16:30:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:52,539 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 763 transitions. [2024-10-11 16:30:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 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-10-11 16:30:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 763 transitions. [2024-10-11 16:30:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 16:30:52,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:52,542 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, 1] [2024-10-11 16:30:52,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 16:30:52,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 16:30:52,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 98438958, now seen corresponding path program 1 times [2024-10-11 16:30:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92231553] [2024-10-11 16:30:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:30:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 16:30:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 16:30:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:30:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92231553] [2024-10-11 16:30:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92231553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:30:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862457626] [2024-10-11 16:30:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:30:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:53,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:30:53,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:30:53,599 INFO L87 Difference]: Start difference. First operand 575 states and 763 transitions. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 10 states have internal predecessors, (173), 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-10-11 16:30:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:55,082 INFO L93 Difference]: Finished difference Result 1102 states and 1475 transitions. [2024-10-11 16:30:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:30:55,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 10 states have internal predecessors, (173), 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 190 [2024-10-11 16:30:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:55,084 INFO L225 Difference]: With dead ends: 1102 [2024-10-11 16:30:55,084 INFO L226 Difference]: Without dead ends: 593 [2024-10-11 16:30:55,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:30:55,087 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 24 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:55,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2647 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 16:30:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states.