./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:34:26,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:34:26,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:34:27,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:34:27,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:34:27,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:34:27,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:34:27,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:34:27,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:34:27,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:34:27,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:34:27,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:34:27,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:34:27,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:34:27,032 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:34:27,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:34:27,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:34:27,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:34:27,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:34:27,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:34:27,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:34:27,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:34:27,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:34:27,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:34:27,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:34:27,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:34:27,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:34:27,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:34:27,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:34:27,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:34:27,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:34:27,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:34:27,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:34:27,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:34:27,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:34:27,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:34:27,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:34:27,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:34:27,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:34:27,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:34:27,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:34:27,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:34:27,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 [2024-10-14 04:34:27,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:34:27,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:34:27,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:34:27,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:34:27,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:34:27,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2024-10-14 04:34:28,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:34:29,447 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:34:29,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2024-10-14 04:34:29,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05caafd2c/a86bb7aab42547d8af0617579239e7cc/FLAGbb372dbef [2024-10-14 04:34:29,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05caafd2c/a86bb7aab42547d8af0617579239e7cc [2024-10-14 04:34:29,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:34:29,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:34:29,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:34:29,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:34:29,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:34:29,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:34:29" (1/1) ... [2024-10-14 04:34:29,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b3bcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:29, skipping insertion in model container [2024-10-14 04:34:29,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:34:29" (1/1) ... [2024-10-14 04:34:30,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:34:31,626 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/combinations/Problem05_label48+token_ring.08.cil-1.c[375709,375722] [2024-10-14 04:34:31,662 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/combinations/Problem05_label48+token_ring.08.cil-1.c[383339,383352] [2024-10-14 04:34:31,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:34:31,891 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:34:32,675 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/combinations/Problem05_label48+token_ring.08.cil-1.c[375709,375722] [2024-10-14 04:34:32,689 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/combinations/Problem05_label48+token_ring.08.cil-1.c[383339,383352] [2024-10-14 04:34:32,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:34:32,765 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:34:32,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32 WrapperNode [2024-10-14 04:34:32,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:34:32,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:34:32,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:34:32,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:34:32,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:32,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,278 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-10-14 04:34:33,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:34:33,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:34:33,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:34:33,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:34:33,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:34:33,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:33,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:34:33,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:34:33,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:34:33,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:34:33,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (1/1) ... [2024-10-14 04:34:34,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:34:34,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:34:34,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:34:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:34:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:34:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:34:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:34:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:34:34,092 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:34:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:34:34,093 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:34:34,093 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:34:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:34:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:34:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:34:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:34:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:34:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:34:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:34:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:34:34,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:34:34,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:34:42,031 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-10-14 04:34:42,031 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:34:42,170 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:34:42,171 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-14 04:34:42,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:34:42 BoogieIcfgContainer [2024-10-14 04:34:42,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:34:42,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:34:42,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:34:42,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:34:42,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:34:29" (1/3) ... [2024-10-14 04:34:42,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:34:42, skipping insertion in model container [2024-10-14 04:34:42,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:32" (2/3) ... [2024-10-14 04:34:42,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:34:42, skipping insertion in model container [2024-10-14 04:34:42,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:34:42" (3/3) ... [2024-10-14 04:34:42,186 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.08.cil-1.c [2024-10-14 04:34:42,201 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:34:42,202 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:34:42,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:34:42,350 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;@46b0d80e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:34:42,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:34:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 04:34:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:42,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:42,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:42,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:42,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2060137260, now seen corresponding path program 1 times [2024-10-14 04:34:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:42,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231539213] [2024-10-14 04:34:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:42,934 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-14 04:34:42,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231539213] [2024-10-14 04:34:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231539213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:42,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:42,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:34:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791609138] [2024-10-14 04:34:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:42,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:34:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:34:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:34:42,981 INFO L87 Difference]: Start difference. First operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:44,480 INFO L93 Difference]: Finished difference Result 4844 states and 9066 transitions. [2024-10-14 04:34:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:34:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:44,520 INFO L225 Difference]: With dead ends: 4844 [2024-10-14 04:34:44,520 INFO L226 Difference]: Without dead ends: 2465 [2024-10-14 04:34:44,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:34:44,534 INFO L432 NwaCegarLoop]: 4181 mSDtfsCounter, 695 mSDsluCounter, 12116 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 16297 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:44,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 16297 Invalid, 806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:34:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-14 04:34:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2375. [2024-10-14 04:34:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2345 states have (on average 1.8426439232409382) internal successors, (4321), 2347 states have internal predecessors, (4321), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 04:34:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4365 transitions. [2024-10-14 04:34:44,717 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4365 transitions. Word has length 121 [2024-10-14 04:34:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:44,718 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 4365 transitions. [2024-10-14 04:34:44,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4365 transitions. [2024-10-14 04:34:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:44,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:44,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:44,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:34:44,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:44,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash 58250990, now seen corresponding path program 1 times [2024-10-14 04:34:44,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:44,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735433233] [2024-10-14 04:34:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:45,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:45,156 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-14 04:34:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735433233] [2024-10-14 04:34:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735433233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:34:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530318944] [2024-10-14 04:34:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:45,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:34:45,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:34:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:34:45,162 INFO L87 Difference]: Start difference. First operand 2375 states and 4365 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:47,345 INFO L93 Difference]: Finished difference Result 3046 states and 5475 transitions. [2024-10-14 04:34:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:34:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:47,359 INFO L225 Difference]: With dead ends: 3046 [2024-10-14 04:34:47,360 INFO L226 Difference]: Without dead ends: 2806 [2024-10-14 04:34:47,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:34:47,363 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 4998 mSDsluCounter, 12445 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5013 SdHoareTripleChecker+Valid, 16599 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:47,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5013 Valid, 16599 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:34:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2024-10-14 04:34:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2627. [2024-10-14 04:34:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2573 states have (on average 1.8239409249902838) internal successors, (4693), 2576 states have internal predecessors, (4693), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-14 04:34:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4774 transitions. [2024-10-14 04:34:47,457 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4774 transitions. Word has length 121 [2024-10-14 04:34:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4774 transitions. [2024-10-14 04:34:47,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4774 transitions. [2024-10-14 04:34:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:47,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:47,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:47,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:34:47,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:47,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash 603539502, now seen corresponding path program 1 times [2024-10-14 04:34:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789867882] [2024-10-14 04:34:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:47,760 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-14 04:34:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789867882] [2024-10-14 04:34:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789867882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683058309] [2024-10-14 04:34:47,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:47,764 INFO L87 Difference]: Start difference. First operand 2627 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:50,489 INFO L93 Difference]: Finished difference Result 3651 states and 6465 transitions. [2024-10-14 04:34:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:34:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:50,503 INFO L225 Difference]: With dead ends: 3651 [2024-10-14 04:34:50,504 INFO L226 Difference]: Without dead ends: 3159 [2024-10-14 04:34:50,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:34:50,511 INFO L432 NwaCegarLoop]: 4300 mSDtfsCounter, 5019 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5034 SdHoareTripleChecker+Valid, 21241 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:50,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5034 Valid, 21241 Invalid, 2691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:34:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-10-14 04:34:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2860. [2024-10-14 04:34:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2782 states have (on average 1.8069734004313445) internal successors, (5027), 2786 states have internal predecessors, (5027), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-14 04:34:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 5144 transitions. [2024-10-14 04:34:50,616 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 5144 transitions. Word has length 121 [2024-10-14 04:34:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:50,617 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 5144 transitions. [2024-10-14 04:34:50,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 5144 transitions. [2024-10-14 04:34:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:50,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:50,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:50,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:34:50,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:50,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1429854544, now seen corresponding path program 1 times [2024-10-14 04:34:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781425975] [2024-10-14 04:34:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:50,852 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-14 04:34:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781425975] [2024-10-14 04:34:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781425975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447325492] [2024-10-14 04:34:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:50,857 INFO L87 Difference]: Start difference. First operand 2860 states and 5144 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:53,039 INFO L93 Difference]: Finished difference Result 4537 states and 7907 transitions. [2024-10-14 04:34:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:34:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:53,060 INFO L225 Difference]: With dead ends: 4537 [2024-10-14 04:34:53,060 INFO L226 Difference]: Without dead ends: 3812 [2024-10-14 04:34:53,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:34:53,066 INFO L432 NwaCegarLoop]: 4163 mSDtfsCounter, 5097 mSDsluCounter, 16578 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 20741 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:53,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 20741 Invalid, 2271 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:34:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2024-10-14 04:34:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3327. [2024-10-14 04:34:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7794439237738207) internal successors, (5696), 3207 states have internal predecessors, (5696), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:34:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5889 transitions. [2024-10-14 04:34:53,243 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5889 transitions. Word has length 121 [2024-10-14 04:34:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:53,243 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5889 transitions. [2024-10-14 04:34:53,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5889 transitions. [2024-10-14 04:34:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:53,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:53,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:53,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:34:53,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:53,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 998404078, now seen corresponding path program 1 times [2024-10-14 04:34:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:53,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254860852] [2024-10-14 04:34:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:53,535 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-14 04:34:53,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254860852] [2024-10-14 04:34:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254860852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:53,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:53,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879173635] [2024-10-14 04:34:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:53,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:53,539 INFO L87 Difference]: Start difference. First operand 3327 states and 5889 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:55,097 INFO L93 Difference]: Finished difference Result 4994 states and 8645 transitions. [2024-10-14 04:34:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:34:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:55,115 INFO L225 Difference]: With dead ends: 4994 [2024-10-14 04:34:55,115 INFO L226 Difference]: Without dead ends: 3802 [2024-10-14 04:34:55,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:34:55,124 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4728 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:55,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 20529 Invalid, 1398 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:34:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2024-10-14 04:34:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3327. [2024-10-14 04:34:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7778819119025304) internal successors, (5691), 3207 states have internal predecessors, (5691), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:34:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5884 transitions. [2024-10-14 04:34:55,300 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5884 transitions. Word has length 121 [2024-10-14 04:34:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:55,301 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5884 transitions. [2024-10-14 04:34:55,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5884 transitions. [2024-10-14 04:34:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:55,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:55,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:55,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:34:55,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -308738320, now seen corresponding path program 1 times [2024-10-14 04:34:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:55,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195914503] [2024-10-14 04:34:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:55,541 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-14 04:34:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195914503] [2024-10-14 04:34:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195914503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992940184] [2024-10-14 04:34:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:55,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:55,546 INFO L87 Difference]: Start difference. First operand 3327 states and 5884 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:56,689 INFO L93 Difference]: Finished difference Result 4983 states and 8609 transitions. [2024-10-14 04:34:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:34:56,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:56,703 INFO L225 Difference]: With dead ends: 4983 [2024-10-14 04:34:56,704 INFO L226 Difference]: Without dead ends: 3791 [2024-10-14 04:34:56,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:34:56,708 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4833 mSDsluCounter, 12312 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 16453 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:56,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 16453 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:34:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-10-14 04:34:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3327. [2024-10-14 04:34:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7763199000312402) internal successors, (5686), 3207 states have internal predecessors, (5686), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:34:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5879 transitions. [2024-10-14 04:34:56,821 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5879 transitions. Word has length 121 [2024-10-14 04:34:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:56,822 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5879 transitions. [2024-10-14 04:34:56,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5879 transitions. [2024-10-14 04:34:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:56,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:56,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:34:56,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 722302578, now seen corresponding path program 1 times [2024-10-14 04:34:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290455369] [2024-10-14 04:34:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:57,018 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-14 04:34:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290455369] [2024-10-14 04:34:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290455369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037787341] [2024-10-14 04:34:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:57,020 INFO L87 Difference]: Start difference. First operand 3327 states and 5879 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:34:59,425 INFO L93 Difference]: Finished difference Result 6219 states and 10582 transitions. [2024-10-14 04:34:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:34:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:34:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:34:59,446 INFO L225 Difference]: With dead ends: 6219 [2024-10-14 04:34:59,447 INFO L226 Difference]: Without dead ends: 5027 [2024-10-14 04:34:59,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:34:59,451 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 5002 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5017 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:34:59,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5017 Valid, 21239 Invalid, 2614 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:34:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2024-10-14 04:34:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4276. [2024-10-14 04:34:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.735816477553034) internal successors, (7037), 4064 states have internal predecessors, (7037), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:34:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7388 transitions. [2024-10-14 04:34:59,619 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7388 transitions. Word has length 121 [2024-10-14 04:34:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:34:59,619 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7388 transitions. [2024-10-14 04:34:59,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:34:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7388 transitions. [2024-10-14 04:34:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:34:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:34:59,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:34:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:34:59,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:34:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:34:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1184100688, now seen corresponding path program 1 times [2024-10-14 04:34:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:34:59,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875842147] [2024-10-14 04:34:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:34:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:34:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:34:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:34:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:34:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:34:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:34:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:34:59,815 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-14 04:34:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:34:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875842147] [2024-10-14 04:34:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875842147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:34:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:34:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:34:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064822633] [2024-10-14 04:34:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:34:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:34:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:34:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:34:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:34:59,821 INFO L87 Difference]: Start difference. First operand 4276 states and 7388 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:01,126 INFO L93 Difference]: Finished difference Result 7177 states and 12134 transitions. [2024-10-14 04:35:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:01,150 INFO L225 Difference]: With dead ends: 7177 [2024-10-14 04:35:01,151 INFO L226 Difference]: Without dead ends: 5036 [2024-10-14 04:35:01,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:01,160 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4724 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:01,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 20529 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:35:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2024-10-14 04:35:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4276. [2024-10-14 04:35:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.7335964479526393) internal successors, (7028), 4064 states have internal predecessors, (7028), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:35:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7379 transitions. [2024-10-14 04:35:01,350 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7379 transitions. Word has length 121 [2024-10-14 04:35:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:01,351 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7379 transitions. [2024-10-14 04:35:01,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7379 transitions. [2024-10-14 04:35:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:01,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:01,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:01,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:35:01,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 416970418, now seen corresponding path program 1 times [2024-10-14 04:35:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510892464] [2024-10-14 04:35:01,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,557 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-14 04:35:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510892464] [2024-10-14 04:35:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510892464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042174497] [2024-10-14 04:35:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:01,562 INFO L87 Difference]: Start difference. First operand 4276 states and 7379 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:04,035 INFO L93 Difference]: Finished difference Result 9610 states and 16003 transitions. [2024-10-14 04:35:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:04,056 INFO L225 Difference]: With dead ends: 9610 [2024-10-14 04:35:04,056 INFO L226 Difference]: Without dead ends: 7469 [2024-10-14 04:35:04,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:35:04,064 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 4994 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:04,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 21239 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:35:04,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2024-10-14 04:35:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6184. [2024-10-14 04:35:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 5770 states have (on average 1.6863084922010398) internal successors, (9730), 5788 states have internal predecessors, (9730), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-14 04:35:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 10415 transitions. [2024-10-14 04:35:04,337 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 10415 transitions. Word has length 121 [2024-10-14 04:35:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:04,339 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 10415 transitions. [2024-10-14 04:35:04,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 10415 transitions. [2024-10-14 04:35:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:04,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:04,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:04,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:35:04,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:04,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -639760784, now seen corresponding path program 1 times [2024-10-14 04:35:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612566315] [2024-10-14 04:35:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:04,522 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-14 04:35:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612566315] [2024-10-14 04:35:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612566315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209187199] [2024-10-14 04:35:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:04,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:04,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:04,525 INFO L87 Difference]: Start difference. First operand 6184 states and 10415 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:07,352 INFO L93 Difference]: Finished difference Result 18072 states and 29651 transitions. [2024-10-14 04:35:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:07,395 INFO L225 Difference]: With dead ends: 18072 [2024-10-14 04:35:07,395 INFO L226 Difference]: Without dead ends: 14023 [2024-10-14 04:35:07,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:07,410 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5287 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5311 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:07,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5311 Valid, 21232 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:35:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14023 states. [2024-10-14 04:35:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14023 to 9981. [2024-10-14 04:35:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9981 states, 9199 states have (on average 1.6453962387216001) internal successors, (15136), 9233 states have internal predecessors, (15136), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-14 04:35:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9981 states to 9981 states and 16511 transitions. [2024-10-14 04:35:08,156 INFO L78 Accepts]: Start accepts. Automaton has 9981 states and 16511 transitions. Word has length 121 [2024-10-14 04:35:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 9981 states and 16511 transitions. [2024-10-14 04:35:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9981 states and 16511 transitions. [2024-10-14 04:35:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:08,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:08,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:35:08,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 711624434, now seen corresponding path program 1 times [2024-10-14 04:35:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844049213] [2024-10-14 04:35:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:08,362 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-14 04:35:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:08,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844049213] [2024-10-14 04:35:08,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844049213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51241602] [2024-10-14 04:35:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:08,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:08,364 INFO L87 Difference]: Start difference. First operand 9981 states and 16511 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:12,060 INFO L93 Difference]: Finished difference Result 32883 states and 53741 transitions. [2024-10-14 04:35:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:12,146 INFO L225 Difference]: With dead ends: 32883 [2024-10-14 04:35:12,146 INFO L226 Difference]: Without dead ends: 25037 [2024-10-14 04:35:12,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:12,174 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 5120 mSDsluCounter, 16600 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:12,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 20789 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:35:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25037 states. [2024-10-14 04:35:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25037 to 17414. [2024-10-14 04:35:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 15912 states have (on average 1.6165158371040724) internal successors, (25722), 15978 states have internal predecessors, (25722), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-14 04:35:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 28607 transitions. [2024-10-14 04:35:13,084 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 28607 transitions. Word has length 121 [2024-10-14 04:35:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:13,085 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 28607 transitions. [2024-10-14 04:35:13,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 28607 transitions. [2024-10-14 04:35:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:13,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:13,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:13,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:35:13,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -907350480, now seen corresponding path program 1 times [2024-10-14 04:35:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:13,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097373985] [2024-10-14 04:35:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,268 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-14 04:35:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097373985] [2024-10-14 04:35:13,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097373985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:13,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:13,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104709213] [2024-10-14 04:35:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:13,272 INFO L87 Difference]: Start difference. First operand 17414 states and 28607 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:17,976 INFO L93 Difference]: Finished difference Result 61578 states and 100971 transitions. [2024-10-14 04:35:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:18,142 INFO L225 Difference]: With dead ends: 61578 [2024-10-14 04:35:18,142 INFO L226 Difference]: Without dead ends: 46299 [2024-10-14 04:35:18,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:18,197 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5221 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5245 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:18,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5245 Valid, 21232 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 04:35:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46299 states. [2024-10-14 04:35:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46299 to 32439. [2024-10-14 04:35:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32439 states, 29529 states have (on average 1.598835043516543) internal successors, (47212), 29659 states have internal predecessors, (47212), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-14 04:35:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32439 states to 32439 states and 53539 transitions. [2024-10-14 04:35:20,767 INFO L78 Accepts]: Start accepts. Automaton has 32439 states and 53539 transitions. Word has length 121 [2024-10-14 04:35:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:20,768 INFO L471 AbstractCegarLoop]: Abstraction has 32439 states and 53539 transitions. [2024-10-14 04:35:20,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32439 states and 53539 transitions. [2024-10-14 04:35:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:20,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:20,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:20,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:35:20,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:20,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1790859470, now seen corresponding path program 1 times [2024-10-14 04:35:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:20,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391918260] [2024-10-14 04:35:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:20,964 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-14 04:35:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391918260] [2024-10-14 04:35:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391918260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:20,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982705310] [2024-10-14 04:35:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:20,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:20,967 INFO L87 Difference]: Start difference. First operand 32439 states and 53539 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:27,776 INFO L93 Difference]: Finished difference Result 116759 states and 193853 transitions. [2024-10-14 04:35:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:35:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:28,160 INFO L225 Difference]: With dead ends: 116759 [2024-10-14 04:35:28,160 INFO L226 Difference]: Without dead ends: 86455 [2024-10-14 04:35:28,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:28,314 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5030 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:28,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 21232 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:35:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86455 states. [2024-10-14 04:35:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86455 to 62617. [2024-10-14 04:35:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62617 states, 56955 states have (on average 1.5903081380036872) internal successors, (90576), 57213 states have internal predecessors, (90576), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-14 04:35:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62617 states to 62617 states and 105117 transitions. [2024-10-14 04:35:33,403 INFO L78 Accepts]: Start accepts. Automaton has 62617 states and 105117 transitions. Word has length 121 [2024-10-14 04:35:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:33,404 INFO L471 AbstractCegarLoop]: Abstraction has 62617 states and 105117 transitions. [2024-10-14 04:35:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62617 states and 105117 transitions. [2024-10-14 04:35:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:35:33,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:33,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:35:33,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:35:33,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:33,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash 563525812, now seen corresponding path program 1 times [2024-10-14 04:35:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:33,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059435497] [2024-10-14 04:35:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:35:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:35:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:35:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:35:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,624 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-14 04:35:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059435497] [2024-10-14 04:35:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059435497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249999982] [2024-10-14 04:35:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:33,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:33,626 INFO L87 Difference]: Start difference. First operand 62617 states and 105117 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)